标签：int surprise turn panel ring longest view nsis mat
InputInput consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.OutputOutput consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0.
The lengths of s1 and s2 will be at most 50000.Sample Input
clinton homer riemann marjorie
Sample Output
0
rie 3
题意：找最长前缀和最长后缀
题解：kmp的next数组一步到位，刚开始wa了一发，冷静了一下发现要是结果大于两个的最小长度，就会wa。。。。
例如：aaaa
aaa
#include<map> #include<set> #include<cmath> #include<queue> #include<stack> #include<vector> #include<cstdio> #include<iomanip> #include<cstdlib> #include<cstring> #include<iostream> #include<algorithm> #define pi acos(-1) #define ll long long #define mod 1000000007 #define ls l,m,rt<<1 #define rs m+1,r,rt<<1|1 using namespace std; const double g=10.0,eps=1e-9; const int N=100000+5,maxn=60+5,inf=0x3f3f3f3f; int Next[N],slen; string str,ptr; void getnext() { int k=-1; Next[0]=-1; for(int i=1;i<slen;i++) { while(k>-1&&str[k+1]!=str[i])k=Next[k]; if(str[k+1]==str[i])k++; Next[i]=k; } } int main() { ios::sync_with_stdio(false); cin.tie(0); // cout<<setiosflags(ios::fixed)<<setprecision(2); while(cin>>ptr>>str){ int minn=min(ptr.size(),str.size()); str=ptr+str; slen=str.size(); getnext(); int ans=Next[slen-1]+1; if(ans>minn)ans=minn; if(ans==0)cout<<0<<endl; else cout<<ptr.substr(0,ans)<<" "<<ans<<endl; } return 0; }
标签：int surprise turn panel ring longest view nsis mat
原文地址：http://www.cnblogs.com/acjiumeng/p/6818735.html
