题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4763
这个题目有点......,先是数据范围看错,一百万看成10万,果断后缀数组,RE之后发现错误,改数组,果断TLE
后来想肯定是一个线性算法,只有KMP,无奈枚举首尾位置,KMP进行匹配AC!
#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
#include <cmath>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
#define eps 1e-8
#define inf 1e10
#define maxn 1100000
char str[maxn];
int next[maxn];
int get_next(){
int i=0,j=-1;
next[0]=-1;
while(str[i]){
if(j==-1 || str[i]==str[j]){
i++;j++;next[i]=j;
}
else j=next[j];
}
return 0;
}
bool find_ans(char *rec,char *str,int t,int n)
{
int ans=0;
int i=0,j=0;
while(i<t)//rec[i])
{
if(rec[i]==str[j])
{
if(j==n-1)
return true;
else
j++,i++;
}
else
{
j=next[j];
}
if(j==-1)
j=0,i++;
}
return false;
}
int main(){
int i,j,k,t,len;
char ch,ch1;
scanf("%d",&t);
while(t--){
scanf("%s",str);
len=strlen(str);
if(len<=2){
printf("%d\n",0);
continue;
}
get_next();
if(next[len]==0){
printf("%d\n",0);
continue;
}
//printf("\n\n\n");
for(i=len/3;i>=1;i--){
//printf("i:%d\n",i);
ch=str[i];str[i]=0;
ch1=str[len-i];
if(strcmp(str,str+len-i)==0){
// printf("%s %s\n",str+len-i,str);
str[len-i]=0;str[i]=ch;
str[i]=ch;
str[len-i]=ch1;
if(find_ans(str+i,str,len-i*2,i)){
printf("%d\n",i);
break;
}
}
str[i]=ch;
str[len-i]=ch1;
}
if(i==0){
printf("%d\n",0);
}
}
return 0;
}