P3616 富金森林公园

来源：互联网发布：js 删除cookie 编辑：程序博客网时间：2024/04/19 05:29
#include<cstdio>#include<iostream>#include<algorithm>#include<map>using namespace std;#define rep(i,j,k) for(i=j;i<=k;++i)#define per(i,j,k) for(i=j;i>=k;--i)#define ll long long#define db double#define ldb long double#define pii pair<int,int>#define mkp make_pair#define X first#define Y second#define G c=getchar()void read(int&x) {char c;for(G;c<48;G);for(x=0;c>47&&c<58;G)x=x*10+c-48;}const int N=2000005;struct QUERY{int b,c,d;}qu[N];int n,m,a[N],T[N],tmp[N<<1],ln,tot,sa[N],vis[N];inline void add(int x,const int&y){    for(int z=x;z<=tot;z+=z&-z)T[z]+=y;}bool cmp(const int&x,const int&y){    return a[x]>a[y];}inline int query(int x){    int y=0;    for(;x;x-=x&-x)y+=T[x];    return y;}int main(){    int i,x;    read(n);read(m);    rep(i,1,n){        read(a[i]);        tmp[++ln]=a[i];    }    rep(i,1,m){        read(qu[i].b);read(qu[i].c);        if(qu[i].b==2){            read(qu[i].d);            tmp[++ln]=qu[i].d;        }        else tmp[++ln]=qu[i].c;    }    sort(tmp+1,tmp+ln+1);    rep(i,1,ln)if(tmp[i]>tmp[i-1])tmp[++tot]=tmp[i];    rep(i,1,n)a[i]=lower_bound(tmp+1,tmp+tot+1,a[i])-tmp;    rep(i,1,m)    if(qu[i].b==1)qu[i].c=lower_bound(tmp+1,tmp+tot+1,qu[i].c)-tmp;    else qu[i].d=lower_bound(tmp+1,tmp+tot+1,qu[i].d)-tmp;    rep(i,1,n)sa[i]=i;    sort(sa+1,sa+n+1,cmp);    rep(i,1,n){        vis[x=sa[i]]=1;        add(a[x],(!vis[x-1])+(!vis[x+1])-1);    }    rep(i,1,m){        if(qu[i].b==2){            x=qu[i].c;            add(a[x],(x>1&&a[x-1]>=a[x])+(x<n&&a[x+1]>=a[x])-1);            if(x<n&&a[x+1]<a[x])add(a[x+1],1);            if(x>1&&a[x-1]<a[x])add(a[x-1],1);            a[x]=qu[i].d;            add(a[x],1-(x>1&&a[x-1]>=a[x])-(x<n&&a[x+1]>=a[x]));            if(x<n&&a[x+1]<a[x])add(a[x+1],-1);            if(x>1&&a[x-1]<a[x])add(a[x-1],-1);        }        else printf("%d\n",1-query(qu[i].c-1));    }    return 0;}
0 1