传送门
这就是LCT板子题。。
明显修改就是cut再link,查询就是把链拉出来统计长度再-1
然后也没什么了,注意m是后输入的(不要问我为什么要说这个)
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
using namespace std;
inline int read(){
int x=0,f=1;char ch=' ';
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
const int N=2e5+5;
namespace LCT{
int ch[N][2],f[N],sum[N],rev[N];
inline bool get(int x){return ch[f[x]][1]==x;}
inline void update(int x){sum[x]=sum[ch[x][0]]+sum[ch[x][1]]+1;}
inline void reverse(int x){rev[x]^=1;swap(ch[x][0],ch[x][1]);}
inline bool isroot(int x){return ch[f[x]][0]!=x&&ch[f[x]][1]!=x;}
inline void pushdown(int x){
if(rev[x]){
if(ch[x][0])reverse(ch[x][0]);
if(ch[x][1])reverse(ch[x][1]);
rev[x]=0;
}
}
inline void pd(int x){if(!isroot(x))pd(f[x]);pushdown(x);}
inline void rotate(int x){
int y=f[x],z=f[y],w=get(x);
f[x]=z;if(!isroot(y))ch[z][get(y)]=x;
ch[y][w]=ch[x][w^1];f[ch[y][w]]=y;
ch[x][w^1]=y;f[y]=x;
update(y);update(x);
}
inline void Splay(int x){
pd(x);
for(int fa=f[x];!isroot(x);rotate(x),fa=f[x])
if(!isroot(fa))
rotate(get(fa)==get(x)?fa:x);
}
inline void access(int x){for(int y=0;x;y=x,x=f[x])Splay(x),ch[x][1]=y,update(x);}
inline void makeroot(int x){access(x);Splay(x);reverse(x);}
inline int findroot(int x){access(x);Splay(x);while(ch[x][0])x=ch[x][0];return x;}
inline void split(int x,int y){makeroot(x);access(y);Splay(y);}
inline void link(int x,int y){split(x,y);f[x]=y;}
inline void cut(int x,int y){split(x,y);f[x]=ch[y][0]=0;}
};
using namespace LCT;
int n,m;
int k[N];
int main(){
n=read();sum[n+1]=1;
for(int i=1;i<=n;++i)k[i]=read(),sum[i]=1;
for(int i=1;i<=n;++i){
int x=i,y=i+k[i];
if(y>n)y=n+1;
link(x,y);
}
m=read();
for(int i=1;i<=m;++i){
int opt=read();
if(opt==1){
int x=read()+1;
split(x,n+1);
printf("%d\n",sum[n+1]-1);
}
else{
int x=read()+1,v=read();
cut(x,min(x+k[x],n+1));
k[x]=v;
link(x,min(x+k[x],n+1));
}
}
return 0;
}