poj1509 Glass Beads sam

给一个循环的字符串。。 求出它的最小表示法， 搞出SS的自动机， 然后直接走n步就可以了。。。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

#define mnx 10020

int ch[mnx << 1][26], par[mnx << 1], val[mnx << 1], sz;
int root, lst;

int creat(int v) {
	++sz;
	val[sz] = v;
	par[sz] = 0;
	memset(ch[sz], 0, sizeof(ch[sz]));
	return sz;
}
void extend(int c) {
	int p = lst;
	int np = creat(val[p] + 1);
	while(p && ch[p][c] == 0) ch[p][c] = np, p = par[p];
	if(!p) par[np] = root;
	else {
		int q = ch[p][c];
		if(val[q] == val[p] + 1)
			par[np] = q;
		else {
			int nq = creat(val[p] + 1);
			memcpy(ch[nq], ch[q], sizeof ch[q]);
			par[nq] = par[q];
			par[q] = nq;
			par[np] = nq;
			while(p && ch[p][c] == q)
				ch[p][c] = nq, p = par[p];
		}
	}
	lst = np;
}

char s[mnx];
int main() {
	int cas;
	scanf("%d", &cas);
	while(cas--) {
		sz = 0;
		root = lst = creat(0);
		scanf("%s", s);
		for(int i = 0; i < 2; ++i)
			for(int j = 0; s[j]; ++j)
				extend(s[j] - 'a');
		int t = root;
		for(int i = 0; s[i]; ++i) {
			for(int j = 0; j < 26; ++j)
				if(ch[t][j]) {
					t = ch[t][j];
					break;
				}
		}
		printf("%d\n", val[t] - strlen(s) + 1);
	}
	return 0;
}