#include<stdio.h>
#include<string.h>
const int maxn = 100005;
char s[maxn];
int cnt[maxn];
int next[maxn];
int ansk;
int ans1[maxn];
int ans2[maxn];
void get_next(int len)
{
int i=0,j=-1;
next[0]=-1;
for(i=1;i<len;i++)
{
while(j>=0 && s[j+1]!=s[i])//j>=0
j=next[j];
if(s[j+1]==s[i])
j++;
next[i]=j;
cnt[j]++;
}
cnt[len-1]=1;
for(i=len-1;i>=0;i--){
if(next[i] != -1)
cnt[next[i]] += cnt[i];
}
}
int main(){
int len;
while(scanf("%s",s) != EOF){
len = strlen(s);
memset(cnt,0,sizeof(cnt));
get_next(len);
int idx = len - 1;
ansk = 0;
while(idx >= 0 ){
ans1[ansk] = idx+1;
ans2[ansk] = cnt[idx];
ansk++;
idx = next[idx];
}
printf("%d\n",ansk);
for(int i = ansk -1 ; i >=0 ; i -- ){
printf("%d %d\n",ans1[i],ans2[i]);
}
}
return 0;
}
http://codeforces.com/contest/432/problem/D
最新推荐文章于 2024-03-08 11:50:40 发布