BZOJ 2223: [Coci 2009]PATULJCI 主席树

2223: [Coci 2009]PATULJCI

Time Limit: 10 Sec  Memory Limit: 259 MB
Submit: 1171  Solved: 497
[Submit][Status][Discuss]

Description

Input

Output

10 3 1 2 1 2 1 2 3 2 3 3 8 1 2 1 3 1 4 1 5 2 5 2 6 6 9 7 10

Sample Input

no
yes 1
no
yes 1
no
yes 2
no
yes 3

Sample Output

HINT

Notice:输入第二个整数是序列中权值的范围Lim，即1<=ai(1<=i<=n)<=Lim。

1<=Lim<=10000

好久没写主席树，都快忘了。。。

水一道  题解见传送门

#include<cmath>#include<ctime>#include<cstdio>#include<cstdlib>#include<cstring>#include<complex>#include<iostream>#include<algorithm>#include<iomanip>#include<vector>#include<string>#include<queue>#include<set>#include<map>using namespace std;inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}return f*x;}const int N=301000;int n,lim,m,cnt,root[N];struct president_tree{int ls,rs,w;}tr[N<<4];void add(int l,int r,int x,int &y,int val){y=++cnt;tr[y].w=tr[x].w+1;int mid=l+r>>1;if(l==r)return ;tr[y].ls=tr[x].ls;tr[y].rs=tr[x].rs;if(mid>=val)add(l,mid,tr[x].ls,tr[y].ls,val);else if(mid<val)add(mid+1,r,tr[x].rs,tr[y].rs,val);}void query(int a,int b){int x=root[a-1],y=root[b],l=1,r=lim,aim=(b-a+1)>>1;while(l!=r){int mid=l+r>>1;if(tr[y].w-tr[x].w<=aim){puts("no");return ;}if(tr[tr[y].ls].w-tr[tr[x].ls].w>aim){x=tr[x].ls;y=tr[y].ls;r=mid;}else if(tr[tr[y].rs].w-tr[tr[x].rs].w>aim){x=tr[x].rs;y=tr[y].rs;l=mid+1;}else {puts("no");return ;}}printf("yes %d\n",l);}int main(){n=read();lim=read();int x,y;for(int i=1;i<=n;i++){add(1,lim,root[i-1],root[i],read());}m=read();while(m--){x=read();y=read();query(x,y);}return 0;}/*10 3 1 2 1 2 1 2 3 2 3 3 8 1 2 1 3 1 4 1 5 2 5 2 6 6 9 7 10*/