KMP与循环

结论：循环节长度=当前长度-next[i]

P3435 [POI2006]OKR-Periods of Words

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=1e6+5;//?????????? 4e8
char s[N];
int next[N];
int n,ans;
void get()
{
	next[1]=0;
	for(int i=2,j=0;i<=n;i++)
	{
		while(j>0&&s[i]!=s[j+1])  j=next[j];
		if(s[i]==s[j+1])  j++;
		next[i]=j;
	}
}
void solve()
{
	cin>>n;
	scanf("%s",s+1);
	get();
	for(int i=2,j=2;i<=n;i++,j=i)
	{
		while(next[j])  j=next[j];//求最短 
		if(next[i])  next[i]=j;
		ans+=i-j;
	}
	cout<<ans;
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}

Slot Machines

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=1e6+5;//?????????? 4e8
int next[N],b[N];
int c[N],n,a[N];
void prefix(int s[])
{
	a[0]=-1;
	int i=0,j=-1;
	while(i<n)
	{
		if(j==-1||s[i]==s[j])
		{
			i++;j++;
			a[i]=j;
		}
		else j=a[j];
	}
}
void solve()
{
	cin>>n;
	for(int i=0;i<n;i++)  scanf("%d",&b[i]);
	reverse(b,b+n);
	prefix(b);
	int p=n,k=n,ak=n,ap=n;
	for(int i=0;i<n;i++)
	{
		k=i,p=n-i-a[n-i];
		if((ak+ap>p+k)||(ak+ap==k+p&&ap>p))  ak=k,ap=p;
	}
	cout<<ak<<" "<<ap;
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int indx=1;indx<=T;indx++)
    {
        solve();
//        puts("");
    }
    return 0;
}