Cod sursa(job #2322208)
| Utilizator | Data | 17 ianuarie 2019 16:14:20 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
string a;
int pi[1000002];
int main()
{
int t,i,q,n,mx;
in>>t;
while(t--)
{
in>>a;
n=a.size();
a=' '+a;
q=mx=0;
for(i=2;i<=n;i++)
{
while(q&&a[q+1]!=a[i])
q=pi[q];
if(a[q+1]==a[i])
q++;
pi[i]=q;
if((i%(i-q))==0&&q)
mx=max(mx,i);
}
out<<mx<<"\n";
}
return 0;
}
