bzoj 3524&luogu3567[Poi2014]Couriers

http://www.elijahqi.win/archives/1719
题目描述
Byteasar works for the BAJ company, which sells computer games.

The BAJ company cooperates with many courier companies that deliver the games sold by the BAJ company to its customers.

Byteasar is inspecting the cooperation of the BAJ company with the couriers.

He has a log of successive packages with the courier company that made the delivery specified for each package.

He wants to make sure that no courier company had an unfair advantage over the others.

If a given courier company delivered more than half of all packages sent in some period of time, we say that it dominated in that period.

Byteasar wants to find out which courier companies dominated in certain periods of time, if any.

Help Byteasar out!

Write a program that determines a dominating courier company or that there was none.

给一个数列，每次询问一个区间内有没有一个数出现次数超过一半

输入输出格式
输入格式：

The first line of the standard input contains two integers, and (), separated by a single space, that are the number of packages shipped by the BAJ company and the number of time periods for which the dominating courier is to be determined, respectively.

The courier companies are numbered from to (at most) .

The second line of input contains integers, (), separated by single spaces; is the number of the courier company that delivered the -th package (in shipment chronology).

The lines that follow specify the time period queries, one per line.

Each query is specified by two integers, and (), separated by a single space.

These mean that the courier company dominating in the period between the shipments of the -th and the -th package, including those, is to be determined.

In tests worth of total score, the condition holds, and in tests worth of total score .

输出格式：

The answers to successive queries should be printed to the standard output, one per line.

(Thus a total of lines should be printed.) Each line should hold a single integer: the number of the courier company that dominated in the corresponding time period, or if there was no such company.

输入输出样例
输入样例#1： 复制

7 5
1 1 3 2 3 4 3
1 3
1 4
3 7
1 7
6 6
输出样例#1： 复制

1
0
3
0
4
说明
给一个数列，每次询问一个区间内有没有一个数出现次数超过一半

针对每个节点建立线段树（用主席树实现

建立权值线段树 每次插入 然后统计一下这个数出现的次数 然后询问的时候询问两个根

然后 通过size找到大于等于二分之一的地方

#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("bzoj3524.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]);}
    //for (int i=1;i<=n;++i) print(root[i],1,nn),printf("\n");
    for (int i=1;i<=m;++i){
        int x=read(),y=read();int len=y-x+1;len>>=1;
        printf("%d\n",aa[query(root[x-1],root[y],1,nn,len+1)]);
    }
    return 0;
}