HDU 6208 The Dominator of Strings （kkkkkk....mp）

鶸不想说话

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <vector>

using namespace std;


int nextj[100005];
char S[100005];
int N, num_max;
int be[100005], len[100005];



void get_next(char*ss, int M)
{
    //memset(nextj,-1,sizeof(nextj));
    int i, j;
    nextj[0]=-1;
    i=0; j=-1;
    while(i<M){
        if(j==-1||ss[i]==ss[j])    {++i; ++j; nextj[i]=j;}
        else    j = nextj[j];
    }
}

int kmp(char* ss, int N, char* tt, int M)
{
    int i, j;
    i=0; j=0;
    while(i<N&&j<M){
        if(j==-1||ss[i]==tt[j])    {++i; ++j; }
        else            j = nextj[j];
    }
    if(j==M)     return i-M;
    else    return -1;
}


void solve()
{
    for(int i=0;i<N;++i)
    {
        if(i==num_max) continue;
        int b = be[i], l = len[i];
        get_next(&S[b],l);
        if(kmp(&S[be[num_max]],len[num_max],&S[b],l)==-1)  { printf("No\n"); return;  }
    }

    S[be[num_max]+len[num_max]]=0;
    printf("%s\n",&S[be[num_max]]);
}


int main()
{

    int T;
    scanf("%d",&T);
    while(T--)
    {
        int b=0, l=0;
        num_max=-1;
        scanf("%d",&N);
        for(int i=0;i<N;++i)
        {
            scanf("%s",&S[b]);
            l = strlen(&S[b]);
            be[i]=b, len[i]=l;
            if(l>len[num_max])   num_max=i;
            b+=l;
        }
        if(N==0)    printf("No\n");
        else if(N==1)   printf("%s\n",S);
        else solve();

    }
    return 0;
}