Cod sursa(job #2561560)
| Utilizator | Data | 28 februarie 2020 22:06:57 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
char s[1000001];
int pi[1000001];
int main()
{
int i,n,t,max1;
in>>t;
for(int l=1;l<=t;l++){
max1=0;
in>>(s+1);
n=strlen(s+1);
for(i=2; i<=n; i++)
{
pi[i]=pi[i-1];
while(pi[i]&&s[pi[i]+1]!=s[i])
pi[i]=pi[pi[i]];
if(s[pi[i]+1]==s[i])
pi[i]++;
}
for(i=1;i<=n;i++)
if(pi[i]&&i%(i-pi[i])==0)
max1=max(max1,i);
//for(i=1;i<=n;i++)
//out<<pi[i]<<" ";
out<<max1<<'\n';
}
return 0;
}
