POJ 2217 LCS(后缀数组)

Secretary

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1655		Accepted: 671

Description

The basic condition of success of a political party, it is the good Election Programme. PSOS know about it, so they entrust the top secretary Juliet with this task. Because she wanted to make her work easier, she used her charm to talk round her friend Romeo to help her. Romeo is assistent of another political party and he was writing the programme some time ago. While writing the Programme for Juliet, he used some parts of his previous programme. When he gave the finished Programme to Juliet, they recognized that both programmes are too similar and that someone could notice it. They need to determine the longest part of text which is common to both programmes.

Input

At the first line there is a positive integer N stating the number of assignments to follow. Each assignment consists of exactly two lines of text, each of them contains at most 10000 characters. The end-of-line character is not considered to be a part of the text.

Output

Print a single line of text for each assignment. The line should contain the sentence "Nejdelsi spolecny retezec ma delku X." (The longest common part of text has X characters). Replace X with the length of the longest common substring of both texts.

Sample Input

2
Tady nejsou zadni mimozemstani.
Lide tady take nejsou.
Ja do lesa nepojedu.
V sobotu pojedeme na vylet.

Sample Output

Nejdelsi spolecny retezec ma delku 7.
Nejdelsi spolecny retezec ma delku 5.

Source

CTU FEE Local 1998

题意：求LCS长度。

代码：

 //#include"bits/stdc++.h"
 #include"cstdio"
 #include"map"
 #include"set"
 #include"cmath"
 #include"queue"
 #include"vector"
 #include"string"
 #include"cstring"
 #include"ctime"
 #include"iostream"
 #include"cstdlib"
 #include"algorithm"
 #define db double
 #define ll long long
 #define ull unsigned long long
 #define vec vector<ll>
 #define mt  vector<vec>
 #define ci(x) scanf("%d",&x)
 #define cd(x) scanf("%lf",&x)
 #define cl(x) scanf("%lld",&x)
 #define pi(x) printf("%d\n",x)
 #define pd(x) printf("%f\n",x)
 #define pl(x) printf("%lld\n",x)
 //#define rep(i, x, y) for(int i=x;i<=y;i++)
 #define rep(i, n) for(int i=0;i<n;i++)
 using namespace std;
 const int N   = 1e6 + ;
 const int mod = 1e9 + ;
 const int MOD = mod - ;
 const int inf = 0x3f3f3f3f;
 const db  PI  = acos(-1.0);
 const db  eps = 1e-;
 int sa[N];
 int rk[N];
 int tmp[N];
 int lcp[N];
 int n,k,T;
 bool cmp(int i,int j){
     if(rk[i] != rk[j]) return rk[i]<rk[j];
     else
     {
         int ri=i+k<=n?rk[i+k]:-;
         int rj=j+k<=n?rk[j+k]:-;
         return ri<rj;
     }
 }
 void bulid(string s,int *sa)
 {
     n=(int)s.size();
     for(int i=;i<=n;i++){
         sa[i]=i;
         rk[i]=i<n?s[i]:-;
     }
     for(k=;k<=n;k*=){
         sort(sa,sa+n+,cmp);
         tmp[sa[]]=;
         for(int i=;i<=n;i++){
             tmp[sa[i]]=tmp[sa[i-]]+(cmp(sa[i-],sa[i])?:);
         }
         for(int i=;i<=n;i++){
             rk[i]=tmp[i];
         }
     }
 }
 void LCP(string s,int *sa,int *lcp){
     n=(int)s.size();
     for(int i=;i<=n;i++) rk[sa[i]]=i;
     int h=;
     lcp[]=;
     for(int i=;i<n;i++){
         int j=sa[rk[i]-];
         for (h ? h-- : ; j + h < n&&i + h < n&&s[j + h] == s[i + h]; h++);
         lcp[rk[i]-] = h;
     }
 }
 int main()
 {
     ios::sync_with_stdio();
     cin>>T;
     getchar();
     while(T--)
     {
         string s,t;
         getline(cin,s);//read a line
         getline(cin,t);
         int s1=(int)s.size();
         s+='$'+t;
         n=(int)s.size();
         bulid(s,sa);
         LCP(s,sa,lcp);
         int ma=;
         for(int i = ;i < n; i++){
             if((sa[i]<s1)!=(sa[i+]<s1)) ma=max(ma,lcp[i]);
         }
         printf("Nejdelsi spolecny retezec ma delku %d.\n",ma);
     }
     return ;
 }