4556: [Tjoi2016&Heoi2016]字符串
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 423 Solved: 182
[ Submit][ Status][ Discuss]
Description
佳媛姐姐过生日的时候,她的小伙伴从某东上买了一个生日礼物。生日礼物放在一个神奇的箱子中。箱子外边写了
一个长为n的字符串s,和m个问题。佳媛姐姐必须正确回答这m个问题,才能打开箱子拿到礼物,升职加薪,出任CE
O,嫁给高富帅,走上人生巅峰。每个问题均有a,b,c,d四个参数,问你子串s[a..b]的所有子串和s[c..d]的最长公
共前缀的长度的最大值是多少?佳媛姐姐并不擅长做这样的问题,所以她向你求助,你该如何帮助她呢?
Input
输入的第一行有两个正整数n,m,分别表示字符串的长度和询问的个数。接下来一行是一个长为n的字符串。接下来
m行,每行有4个数a,b,c,d,表示询问s[a..b]的所有子串和s[c..d]的最长公共前缀的最大值。1<=n,m<=100,000,
字符串中仅有小写英文字母,a<=b,c<=d,1<=a,b,c,d<=n
Output
对于每一次询问,输出答案。
Sample Input
5 5
aaaaa
1 1 1 5
1 5 1 1
2 3 2 3
2 4 2 3
2 3 2 4
aaaaa
1 1 1 5
1 5 1 1
2 3 2 3
2 4 2 3
2 3 2 4
Sample Output
1
1
2
2
2
1
2
2
2
HINT
Source
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
const int maxn = 2E5 + 10;
const int T = 30;
int n,m,c1,c2,last,rt,par[maxn],g[maxn][26],len[maxn],pos[maxn],root[maxn]
,key[maxn],L[maxn],fa[maxn][20],c[maxn*T],lc[maxn*T],rc[maxn*T];
char ch[maxn];
vector <int> v[maxn];
int New_node(int le,int ke)
{
int ret = ++c1;
len[ret] = le; key[ret] = ke;
return ret;
}
void Extend(int w,int po)
{
int p = last,np = New_node(len[p] + 1,po);
pos[po] = last = np;
while (p && !g[p][w])
g[p][w] = np,p = par[p];
if (!p) {par[np] = rt; return;}
int q = g[p][w];
if (len[p] + 1 == len[q]) par[np] = q;
else
{
int nq = New_node(len[p] + 1,0);
for (int i = 0; i < 26; i++) g[nq][i] = g[q][i]; //¼ÇµÃ¼ÓÕâ¸öתÒÆ°¡===
par[nq] = par[q]; par[q] = par[np] = nq;
while (p && g[p][w] == q)
g[p][w] = nq,p = par[p];
}
}
int Merge(int o1,int o2,int l,int r)
{
if (!o1) return o2;
if (!o2) return o1;
int ret = ++c2,mid = (l + r) >> 1;
c[ret] = c[o1] + c[o2];
if (l == r) return ret;
lc[ret] = Merge(lc[o1],lc[o2],l,mid);
rc[ret] = Merge(rc[o1],rc[o2],mid+1,r);
return ret;
}
int Insert(int o,int l,int r,int po)
{
int ret = ++c2,mid = (l + r) >> 1;
c[ret] = c[o] + 1;
if (l == r) return ret;
if (po <= mid) lc[ret] = Insert(lc[o],l,mid,po),rc[ret] = rc[o];
else rc[ret] = Insert(rc[o],mid+1,r,po),lc[ret] = lc[o];
return ret;
}
void Dfs(int x)
{
for (int i = 1; i < 20; i++) fa[x][i] = fa[fa[x][i-1]][i-1];
for (int i = 0; i < v[x].size(); i++)
{
int to = v[x][i]; fa[to][0] = x;
L[to] = L[x] + 1; Dfs(to);
root[x] = Merge(root[x],root[to],1,n);
}
if (key[x]) root[x] = Insert(root[x],1,n,key[x]);
}
int Query(int o,int l,int r,int ql,int qr)
{
if ((ql <= l && r <= qr) || !c[o]) return c[o];
int mid = (l + r) >> 1,ret = 0;
if (ql <= mid) ret += Query(lc[o],l,mid,ql,qr);
if (qr > mid) ret += Query(rc[o],mid+1,r,ql,qr);
return ret;
}
bool Judge(int now,int A,int B,int C,int D)
{
int F = pos[D];
for (int j = 19; j >= 0; j--)
if (len[fa[F][j]] >= now) F = fa[F][j];
return Query(root[F],1,n,A + now - 1,B);
}
int getint()
{
char ch = getchar(); int ret = 0;
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9')
ret = ret*10 + ch - '0',ch = getchar();
return ret;
}
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
n = getint(); m = getint(); scanf("%s",ch + 1);
for (int i = 1; i <= n/2; i++) swap(ch[i],ch[n-i+1]);
last = rt = New_node(0,0);
for (int i = 1; i <= n; i++)
Extend(ch[i] - 'a',i);
for (int i = 2; i <= c1; i++)
v[par[i]].push_back(i);
L[rt] = 1; Dfs(rt);
while (m--)
{
int A,B,C,D;
A = getint(); B = getint();
C = getint(); D = getint();
A = n - A + 1; B = n - B + 1;
C = n - C + 1; D = n - D + 1;
int l = 0,r = min(C - D + 1,A - B + 1);
while (r - l > 1)
{
int mid = (l + r) >> 1;
if (Judge(mid,B,A,D,C)) l = mid;
else r = mid;
}
if (Judge(r,B,A,D,C)) printf("%d\n",r);
else printf("%d\n",l);
}
return 0;
}