UVA11557 KMP+HASH

分析：

n个文本，每个文本有一个文本名。现在给出一个文本，求给定文本和n个文本中连续相同行数最大值，并且输出相应的文本名。

最大值为0不需要输出文件名。

HASH + KMP，对所有文本枚举进行匹配，寻找最大值。

代码如下：

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

const int maxL = 1e4+10;
const int maxn = 105;
int Hash[maxn][maxL],Next[maxL];
int Size[maxn],MAX[maxn];
int N,sz,ans;
string name[maxn];
char word[300];
map<string,int>mp;

inline bool check(char x){ return x == ' ';}

int Get(){
    string str = "";
    int len = strlen(word);
    while (len && check(word[len-1])) len--;

    for (int i=0; i<len; i++) {
        if (check(word[i]) && (i==0 || check(word[i-1]))) continue;
        str += word[i];
    }

    if (str=="") return 0;
    if (mp.count(str)) return mp[str];
    return mp[str] = ++sz;
}

void init(){
     mp.clear();
     memset(Hash,0,sizeof(Hash));
     sz = 0;
     int num;

     getchar();
     for (int i=0; i<=N; i++) {
        if (i!=N) {
            gets(word);
            name[i] = word;
        }
        num = 0;
        while (gets(word) && strcmp(word,"***END***")){
               int tmp = Get();
               if (tmp==0) continue;
               Hash[i][++num] = tmp;
        }
        Size[i] = num;
     }
}

void get_next(int n, int *a){
   Next[0] = Next[1] = 0;
   int j = 0;
   for (int i=2; i<=n; i++) {
      while (j && a[j+1]!=a[i]) j = Next[j];
      if (a[j+1]==a[i]) j++;
      Next[i] = j;
   }
}

int kmp(int *a, int n, int *b, int m){
    int j=0, sum = 0;
    for (int i=1; i<=n; i++) {
        while (j && b[j+1] != a[i]) j = Next[j];
        if (b[j+1]==a[i]) j++;
        if (j>=m) return m;
        sum = max(sum,j);
    }
    return sum;
}

void solve(){
    memset(MAX,0,sizeof(MAX));
    ans = 0;
    for (int i=0; i<=Size[N]; i++) {
        get_next(Size[N]-i,Hash[N]);
        for (int k=0; k<N; k++) {
            MAX[k] = max(MAX[k],kmp(Hash[k],Size[k],Hash[N],Size[N]-i));
        }

        for (int k=1; k<Size[N]-i; k++) {
            Hash[N][k] = Hash[N][k+1];
        }
    }
    for (int i=0; i<N; i++) ans = max(ans,MAX[i]);
}

void Print(){
   printf("%d",ans);
   if (ans==0) {printf("\n"); return;}
   for (int i=0; i<N; i++) if (ans == MAX[i]) cout<< " " << name[i];
   printf("\n");
}

int main(){
    while (scanf("%d",&N)!=EOF){
        init();
        solve();
        Print();
    }
    return 0;
}