HDOJ-1238 Substrings!

来源：互联网发布：core java中文版下载编辑：程序博客网时间：2024/04/30 10:34

先对字符串进行排序，直接枚举长度最短的串的子串，再判断是否是其余字符串的公共子串即可。

#include <map>#include <string>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <memory.h>#include <algorithm>#include <vector>using namespace std;bool cmp(string a,string b){return a.size()<b.size();}int main(){int t;vector<string> buf;cin>>t;while(t--){int n;cin>>n;for(int i=0;i<n;i++){string tmp;cin>>tmp;buf.push_back(tmp);}sort(buf.begin(),buf.end(),cmp);string shortest=buf[0];int mmax=0;for(int len=shortest.size();len>=1;len--){for(string::size_type j=0;j<=shortest.size()-len;j++){string tmp=shortest.substr(j,len);string tmp1=tmp;reverse(tmp1.begin(),tmp1.end());int flag=0;for(vector<string>::size_type i=1;i!=buf.size();i++){string tmp2=buf[i];if(tmp2.find(tmp)>shortest.size()&&tmp2.find(tmp1)>shortest.size()){flag=1;break;}}if(!flag)mmax=len;}if(mmax)break;}cout<<mmax<<endl;buf.clear();}return 0;}