hdu 3374 String Proble

kmp+最小表示法

#include<iostream>
#define maxn 1000010
using namespace std;
string str;
int nextt[maxn];
void get_next()
{
	nextt[0]=0;
	for(int i=1;i<str.size();i++)
	{
		int k=nextt[i-1];
		while(str[i]!=str[k]&&k!=0) k=nextt[k-1];
		if(str[i]==str[k]) nextt[i]=k+1;
		else nextt[i]=0;
	}
}
int f(int flag)
{
	int i=0,j=1,k=0;
	while(i<str.size()&&j<str.size()&&k<str.size())
	{
		int t=str[(j+k)%str.size()]-str[(i+k)%str.size()];
		if(!t) k++;
		else
		{
			if(flag)
			{
				if(t>0) i=i+k+1;
				else j=j+k+1;
			}
			else
			{
				if(t<0) i=i+k+1;
				else j=j+k+1; 
			}
			if(i==j) j++;
			k=0;
		}
	}
	return min(i,j);
}
int main()
{
	cin.sync_with_stdio(false);
	while(cin>>str)
	{
		get_next();
		int ans;
		int p=str.size()-nextt[str.size()-1];
		if(str.size()%p==0) ans=str.size()/p;
		else ans=1; 
		int minn=f(0)+1;
		int maxx=f(1)+1;
		cout<<minn<<" "<<ans<<" "<<maxx<<" "<<ans<<endl;
	}
	return 0;
} 
// agctagca