洛谷 P3426 [POI2005]SZA-Template

括弧，这是一个错误的做法，并不能AC

题目描述

Byteasar wants to put a rather long pattern on his house. In order to do this, he has to prepare an appropriate template with letters cut off first. He is going to put the pattern on the wall by putting the pattern on the wall in the appropriate place and painting over it. This way he can "print" all the letters that are on the template at one time (it is not possible to "print" only some of them). It is, however, possible, to paint some letters on the wall several times, as a result of different applications of the template. The letters on the template are adjacent (there are no spaces on it). Of course, it is possible to prepare a template with the whole pattern on it. But Byteasar would like to minimize the cost, so he wants to make a template as short as possible.

TaskWrite a programme that:

reads from the standard input the pattern Byteasar wants to put on his house,determines the minimal length of the template needed to do it,writes the result to the standard output.

Byteasar 想在墙上涂一段很长的字符,他为了做这件事从字符的前面一段中截取了一段作为模版. 然后将模版重复喷涂到相应的位置后就得到了他想要的字符序列.一个字符可以被喷涂很多次,但是一个位置不能喷涂不同的字符.做一个模版很费工夫,所以他想要模版的长度尽量小,求最小长度是多少.拿样例来说 ababbababbabababbabababbababbaba , 模版为前8个字符ababbaba, 喷涂的过程为: ababbababbabababbabababbababbaba

输入输出格式

输入格式：

In the first and only line of the standard input there is one word. It is the pattern Byteasar wants painted on his house. It consists of no more than  and no less than  lower-case (non-capital) letters of the English alphabet.

输出格式：

In the first and only line of the standard output one integer should be written - the minimal number of letters in the template.

输入输出样例

输入样例#1：

ababbababbabababbabababbababbaba

输出样例#1：

8

显然通过nxt我们可以找出所有可能的长度，然后从小到大枚举可以拿90分耶！

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <queue>
#include <time.h>
#define eps 1e-7
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define rep0(j,n) for(int j=0;j<n;++j)
#define rep1(j,n) for(int j=1;j<=n;++j)
#define pb push_back
#define set0(n) memset(n,0,sizeof(n))
#define ll long long
#define ull unsigned long long
#define iter(i,v) for(edge *i=head[v];i;i=i->nxt)
#define print_runtime printf("Running time:%.3lfs
",double(clock())/1000.0)
#define TO(j) printf(#j": %d
",j)
//#define OJ
using namespace std;
const int MAXINT = 500010;
const int MAXNODE = 100010;
const int MAXEDGE = 2*MAXNODE;
char BUF,*buf;
int read(){
    char c=getchar();int f=1,x=0;
    while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-'0';c=getchar();}
    return f*x;
}
char get_ch(){
    char c=getchar();
    while(!isalpha(c)) c=getchar();
    return c;
}
//------------------- Head Files ----------------------//
int nxt[MAXINT];
char s[MAXINT];
vector<int> t;
void getnxt(){
    int l = strlen(s);
    int k=0;
    for(int i=1;i<l;i++){
        for(;s[i]!=s[k]&&k;k=nxt[k-1]);
        if(s[i]==s[k]) k++;
        nxt[i]=k;
    }
}
int test(int len){
    int l = strlen(s),lpos=-1,k=0;
    rep0(i,l){
        for(;s[i]!=s[k]&&k;k=nxt[k-1]);
        if(s[i]==s[k]) k++;
        if(k==len) lpos = i,k=nxt[k-1];
        if(i-lpos>=len) return 0;
    }
    return 1;
}
void get_input();
void work();
int main() {
    get_input();
    work();
    return 0;
}
void work(){
    int l = strlen(s);
    getnxt();
    int k = nxt[l-1];
    while(k){
        t.push_back(k);
        k=nxt[k-1];
    }
    for(int i=t.size()-1;i>=0;i--){
        if(t.size()>=1000&&t[i]<=10000) continue;
        if(test(t[i])) {printf("%d
",t[i]);return ;}
    }
    printf("%d
",l);
}
void get_input(){
    scanf("%s",s);
}