bzoj2223 [Coci 2009]PATULJCI

http://www.elijahqi.win/archives/1717
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

Source
其实两题都不需要离散化 这题同bzoj3524

#include<cstdio>
#include<algorithm>
#define N 550000
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S) {T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
    while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
    return x*f;
}
struct node{
    int left,right,v;
}tree[N*20];
int n,nn,a[N],aa[N],a1[N],m,root[N],num;
inline void update(int x){
    int l=tree[x].left,r=tree[x].right;
    tree[x].v=tree[l].v+tree[r].v;
}
void insert1(int &x,int l,int r,int p){
    tree[++num]=tree[x];x=num;
    if (l==r) {tree[x].v++;return;}
    int mid=l+r>>1;
    if (p<=mid) insert1(tree[x].left,l,mid,p);else insert1(tree[x].right,mid+1,r,p);update(x);
}
int query(int rt1,int rt2,int l,int r,int size){
    if (tree[rt2].v-tree[rt1].v<size) return 0;
    if (l==r) return l;int mid=l+r>>1;int l1=tree[rt1].left,l2=tree[rt2].left;
    if(tree[l2].v-tree[l1].v>=size) return query(l1,l2,l,mid,size);else return query(tree[rt1].right,tree[rt2].right,mid+1,r,size);
}
void print(int x,int l,int r){
    int mid=l+r>>1;
    if(tree[x].left) print(tree[x].left,l,mid);
    if (l==r) printf("%d:%d ",l,tree[x].v);
    if (tree[x].right) print(tree[x].right,mid+1,r);
}
int main(){
    freopen("bzoj2223.in","r",stdin);
    n=read();m=read();for (int i=1;i<=n;++i) a[i]=read(),aa[i]=a[i];
    sort(aa+1,aa+n+1);nn=unique(aa+1,aa+n+1)-aa-1;
    for (int i=1;i<=n;++i) a1[i]=lower_bound(aa+1,aa+nn+1,a[i])-aa;
    for (int i=1;i<=n;++i) {root[i]=root[i-1];insert1(root[i],1,nn,a1[i]);}m=read();
    for (int i=1;i<=m;++i){
        int x=read(),y=read();int len=y-x+1;len>>=1;
        int ret=query(root[x-1],root[y],1,nn,len+1);
        if (!ret) printf("no\n");else printf("yes %d\n",aa[ret]);
    }
    return 0;
}