题目链接:https://www.nowcoder.com/acm/contest/94/E
题目大意:给定n个字符串,编号1-n,q次询问,每次询问一个了l,r,求r号字符串的前缀和l号的后缀匹配最大程度
思路1:因为给定字符串只有ATCG四个字母,我们在r和l字符串中间加任意一个其他字符,通过KMP的Get_next即可求出,即Next[len]即为最后答案,因为中间添加了其他字符,所以l的后缀肯定不会用到r的字母,保证答案的正确性
代码:
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define FOU(i,x,y) for(int i=x;i<=y;i++)
#define FOD(i,x,y) for(int i=x;i>=y;i--)
#define MEM(a,val) memset(a,val,sizeof(a))
#define PI acos(-1.0)
const double EXP = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const ll MINF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9+7;
const int N = 3e6+5;
string a[N];
int Next[N];
void Get_next(string s)
{
int len = s.size();
int i,j;
j = Next[0] = -1;
i = 0;
while(i<len)
{
while(j!=-1&&s[i]!=s[j])
j = Next[j];
Next[++i] = ++j;
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
std::ios::sync_with_stdio(false);
int n,q,l,r;
while(cin>>n)
{
for(int i=1;i<=n;i++)
cin>>a[i];
cin>>q;
while(q--)
{
cin>>l>>r;
string ss = a[r] + '@' + a[l];
Get_next(ss);
cout<<Next[ss.size()]<<endl;
}
}
return 0;
}
思路2:将r串看成模式串去匹配l串,当l匹配到最后对应r串的位置就是两个串匹配的位置
代码:
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define FOU(i,x,y) for(int i=x;i<=y;i++)
#define FOD(i,x,y) for(int i=x;i>=y;i--)
#define MEM(a,val) memset(a,val,sizeof(a))
#define PI acos(-1.0)
const double EXP = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const ll MINF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9+7;
const int N = 1e6+5;
string a[N];
int Next[N];
void Get_next(string s)
{
int len = s.size();
int i,j;
j = Next[0] = -1;
i = 0;
while(i<len)
{
while(j!=-1&&s[i]!=s[j])
j = Next[j];
Next[++i] = ++j;
}
}
int KMP(string str,string mo)
{
Get_next(mo);
int len = str.size();
int i=0,j=0;
while(i<len)
{
//防止一下模式串越界,必须写到这前面,因为最后要返回j的值,不能在后面改变
if(j==molen)
j = Next[j];
while(j!=-1&&str[i]!=mo[j])
j = Next[j];
i++;
j++;
}
return j;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
std::ios::sync_with_stdio(false);
int n,q,l,r;
while(cin>>n)
{
for(int i=1;i<=n;i++)
cin>>a[i];
cin>>q;
while(q--)
{
cin>>l>>r;
cout<<KMP(a[l],a[r])<<endl;
}
}
return 0;
}