Description
给定一个n排列a[],m次询问a[L]~a[R]中最长连续值域
n
,
m
≤
5
×
1
0
5
n,m\le 5\times 10^5
n,m≤5×105
Solution
一个比较naive的响法就是我们离线然后莫队+线段树做,这样是
O
(
n
n
log
n
)
O(n\sqrt n\log n)
O(nnlogn)的
然后本地测了一下5e5直接线段树是10s,zkw线段树大概是3s
考虑只有插入操作要怎么搞。我们可以用并查集维护连续的值域,这样答案一定是不减的
于是直接上回滚莫队就好了,并查集用按秩合并就没必要可持久化
Code
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <stack>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
const int INF=0x3f3f3f3f;
const int N=60005;
std:: stack <int> stack;
struct Q {int l,r,id;} q[N];
int bel[N],st[N],ed[N],ans[N];
int fa[N],size[N],a[N];
int u[N],d[N];
bool vis[N];
int find(int x) {
return fa[x]?find(fa[x]):x;
}
void merge(int x,int y) {
x=find(x),y=find(y);
if (x==y) return ;
if (size[x]>size[y]) std:: swap(x,y);
fa[x]=y; size[y]+=size[x];
stack.push(x);
}
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
bool cmp(Q a,Q b) {
return (bel[a.l]==bel[b.l])?(a.r<b.r):(bel[a.l]<bel[b.l]);
}
int main(void) {
freopen("data.in","r",stdin);
freopen("myp.out","w",stdout);
int n=read(),m=read();
int B=sqrt(n);
rep(i,1,n) a[i]=read();
rep(i,1,m) q[i].l=read(),q[i].r=read(),q[i].id=i;
rep(i,1,n) {
bel[i]=(i-1)/B+1;
if (!st[bel[i]]) st[bel[i]]=i;
ed[bel[i]]=i;
}
std:: sort(q+1,q+m+1,cmp);
int l,r,tmp1,tmp2,pos;
rep(i,0,n) u[i]=0,d[i]=INF;
rep(i,1,m) {
if (bel[q[i].l]!=bel[q[i-1].l]) {
pos=l=bel[q[i].l]*B+1; r=l-1;
rep(i,1,n) fa[i]=0,size[i]=1,vis[i]=0;
tmp1=tmp2=0;
}
if (bel[q[i].l]==bel[q[i].r]) {
rep(j,q[i].l,q[i].r) {
u[a[j]]=std:: max(u[a[j]+1],a[j]);
d[a[j]]=std:: min(d[a[j]-1],a[j]);
d[u[a[j]]]=d[a[j]];
u[d[a[j]]]=u[a[j]];
ans[q[i].id]=std:: max(ans[q[i].id],u[a[j]]-d[a[j]]+1);
}
rep(j,q[i].l,q[i].r) u[a[j]]=0,d[a[j]]=INF;
continue;
}
for (;r<q[i].r;) {
vis[a[++r]]=1;
if (vis[a[r]+1]) merge(a[r],a[r]+1);
if (vis[a[r]-1]) merge(a[r]-1,a[r]);
tmp1=std:: max(tmp1,size[find(a[r])]);
}
tmp2=tmp1; int wjp=stack.size();
for (;l>q[i].l;) {
vis[a[--l]]=1;
if (vis[a[l]+1]) merge(a[l],a[l]+1);
if (vis[a[l]-1]) merge(a[l]-1,a[l]);
tmp1=std:: max(tmp1,size[find(a[l])]);
}
ans[q[i].id]=tmp1;
tmp1=tmp2;
for (;l<pos;) vis[a[l++]]=0;
while (stack.size()>wjp) {
int x=stack.top(); stack.pop();
size[fa[x]]-=size[x];
fa[x]=0;
}
}
rep(i,1,m) printf("%d\n", ans[i]);
return 0;
}