Total Submission(s): 6032 Accepted Submission(s): 2666
2 3 ABCD BCDFF BRCD 2 rose orchid
2 2
STL很强大啊!
//#include"StdAfx.h" #include<iostream> #include<string> #include<cstring> #include<algorithm> using namespace std; int main() { int t,n,i,j,k; cin>>t; while(t--) { cin>>n; string *a=new string[n]; string *b=new string[n]; int minLength =150; int minIndex; for(i=0;i<n;i++) { cin>>a[i]; b[i]=a[i]; reverse(b[i].begin(),b[i].end()); if(minLength>a[i].length()) { minLength=a[i].length(); minIndex=i; } } string subString; bool fail; int maxLength=0; for(i=0;i<minLength;i++) for(j=1;j<=minLength-i;j++) { fail=0; subString=a[minIndex].substr(i,j); for(k=0;k<n;k++) { if(a[k].find(subString)!=-1&&k==n-1) { maxLength=max(maxLength,j); } if(a[k].find(subString)==-1) { if(b[k].find(subString)==-1) { fail=1; break; } else if(k==n-1) maxLength=max(maxLength,j); } } if(fail==1) break; } delete []a; delete []b; cout<<maxLength<<endl; } return 0; }