HDU3727 Jewel（主席树+树状数组（或二分））

Problem Description

Jimmy wants to make a special necklace for his girlfriend. He bought many beads with various sizes, and no two beads are with the same size. Jimmy can't remember all the details about the beads, for the necklace is so long. So he turns to you for help.

Initially, there is no bead at all, that is, there is an empty chain. Jimmy always sticks the new bead to the right of the chain, to make the chain longer and longer. We number the leftmost bead as Position 1, and the bead to its right as Position 2, and so on. Jimmy usually asks questions about the beads' positions, size ranks and actual sizes. Specifically speaking, there are 4 kinds of operations you should process:

Insert x 
Put a bead with size x to the right of the chain (0 < x < 231, and x is different from all the sizes of beads currently in the chain)
Query_1 s t k 
Query the k-th smallest bead between position s and t, inclusive. You can assume 1 <= s <= t <= L, (L is the length of the current chain), and 1 <= k <= min (100, t-s+1)
Query_2 x
Query the rank of the bead with size x, if we sort all the current beads by ascent order of sizes. The result should between 1 and L (L is the length of the current chain)
Query_3 k
Query the size of the k-th smallest bead currently (1 <= k <= L, L is the length of the current chain)

 

Input

There are several test cases in the input. The first line for each test case is an integer N, indicating the number of operations. Then N lines follow, each line contains one operation, as described above.

You can assume the amount of "Insert" operation is no more than 100000, and the amounts of "Query_1", "Query_2" and "Query_3" are all less than 35000.
There are several test cases in the input. The first line for each test case is an integer N, indicating the number of operations. Then N lines follow, each line contains one operation, as described above.

You can assume the amount of "Insert" operation is no more than 100000, and the amounts of "Query_1", "Query_2" and "Query_3" are all less than 35000.Query the rank of the bead with size x, if we sort all the current beads by ascent order of sizes. The result should between 1 and L (L is the length of the current chain)
Query_3 k
Query the size of the k-th smallest bead currently (1 <= k <= L, L is the length of the current chain)

 

Output

Output 4 lines for each test case. The first line is "Case T:", where T is the id of the case. The next 3 lines indicate the sum of results for Query_1, Query_2 and Query_3, respectively.

 

Sample Input

10

Insert 1

Insert 4

Insert 2

Insert 5

Insert 6

Query_11 5 5

Query_1 2 3 2

Query_2 4

Query_3 3

Query_3 1

 

Sample Output

Case 1:

10

3

5

Hint

The answers for the 5 queries are 6, 4, 3, 4, 1, respectively.

题意：

输入n，再输入n个操作，操作有四种

0，  Insert X：插入x到序列末尾 
 1，  query_1 L R X：在当前序列中的[l,r]区间找第x小的数。 
 2，  query_2 X：在当前序列中，输出X是第几小的数。 
 3，  query_3 X：找到当前序列中第X小的数是几。 
然后输出的是3种query的和。

思路：

操作1和操作3是查询区间第k小，主席树。

操作2是求排名，用树状数组或者二分。

在线转化为离线。

求Kth的主席树的模板见我之前写的：http://www.cnblogs.com/hua-dong/p/7931778.html

操作2为二分的代码：

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int maxn=;
int a[maxn],b[maxn],Innum,n;//a是位置，b是值。Innum是输入的个数，即
int cnt,ql,qr,Case=;
long long sum1,sum2,sum3;
struct questions
{
    int opt;//0,1,2,3
    int x,y,k;
}Qst[maxn<<];
struct PLTree
{
    int ch[maxn * ][],sum[maxn * ],rt[maxn];
    void build(int& now,int l,int r)
    {
        now = ++ cnt;
        sum[now] = ;
        if(l == r) return ;
        int Mid = (l + r)>>;
        build(ch[now][],l,Mid);
        build(ch[now][],Mid + ,r);
    }
    void insert(int& now,int last,int l,int r,int pos)
    {
        now = ++ cnt;
        ch[now][]=ch[last][];
        ch[now][]=ch[last][];
        sum[now] = sum[last] + ;
        if(l == r) return ;
        int Mid = (l+r) >> ;
        if(pos <= Mid) insert(ch[now][],ch[last][],l,Mid,pos);
        else insert(ch[now][],ch[last][],Mid + ,r,pos);
    }
    int query(int ss,int tt,int l,int r,int k)
    {
         if(l == r) return l;
         int Mid =(l + r) >> ,tmp = sum[ch[tt][]] - sum[ch[ss][]];
         if(k <= tmp) return query(ch[ss][],ch[tt][],l,Mid,k);
         else return query(ch[ss][],ch[tt][],Mid + ,r,k - tmp);
    }
};
PLTree P;
void _init()
{
    Innum=cnt=;
    sum1=sum2=sum3=;
}
void _scanf()
{
    char chr[];
    for(int i=;i<=n;i++){
        scanf("%s",chr);
        if(chr[]=='I'){
            Qst[i].opt=;
            scanf("%d",&Qst[i].x);
            a[++Innum]=Qst[i].x;
            b[Innum]=a[Innum];
        }
        else {
            Qst[i].opt=chr[]-'';
            if(chr[]=='')   scanf("%d%d%d",&Qst[i].x,&Qst[i].y,&Qst[i].k);
            else   scanf("%d",&Qst[i].k);
        }
    }
}
void _disp()
{
    sort(b+,b+Innum+);
    for(int i=;i<=Innum;i++)
      a[i]=lower_bound(b+,b+Innum+,a[i])-b;
}
void _work()
{
    P.build(P.rt[],,Innum);
    int nowcnt=,ans;
    for(int i=;i<=n;i++){
        if(Qst[i].opt==) {
            nowcnt++;
            P.insert(P.rt[nowcnt],P.rt[nowcnt-],,Innum,a[nowcnt]);
        }
        else if(Qst[i].opt==){
            ans=P.query(P.rt[Qst[i].x-],P.rt[Qst[i].y],,Innum,Qst[i].k);
            sum1+=b[ans];
        }
        else if(Qst[i].opt==){
            int L=,R=nowcnt;
            while(L<=R){
                int Mid=(L+R)>>;
                ans=P.query(P.rt[],P.rt[nowcnt],,Innum,Mid);
                if(b[ans]==Qst[i].k) {
                   sum2+=Mid;
                   break;
                }
                else if(b[ans]<Qst[i].k) L=Mid+;
                else R=Mid-;
            }
        }
        else {
            ans=P.query(P.rt[],P.rt[nowcnt],,Innum,Qst[i].k);
            sum3+=b[ans];
        }
    }
    printf("Case %d:\n",++Case);
    printf("%lld\n%lld\n%lld\n",sum1,sum2,sum3);
}
int main()
{
    while(~scanf("%d",&n)){
        _init();
        _scanf();//输入
        _disp();//离散
        _work();
    }
    return ;
}

操作2为树状数组的代码：

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int maxn=;
int a[maxn],b[maxn],Innum,n;//a是位置，b是值。Innum是操作为输入的个数，即
int cnt,ql,qr,Case=;
long long  sum1,sum2,sum3;
int c[maxn<<];
int lowbit(int x )
{
    return x&-x;
}
void add( int x )
{
    while(x < Innum){
        c[x]++;
        x += lowbit ( x );
    }
}
int sum(int x )
{
    int ret = ;
    while (x){
        ret += c[x];
        x -= lowbit ( x );
    }
    return ret;
}
struct questions
{
    int opt;//0,1,2,3
    int x,y,k;
}Qst[maxn<<];
struct PLTree
{
    int ch[maxn * ][],sum[maxn * ],rt[maxn];
    void build(int& now,int l,int r)
    {
        now = ++ cnt;
        sum[now] = ;
        if(l == r) return ;
        int Mid = (l + r)>>;
        build(ch[now][],l,Mid);
        build(ch[now][],Mid + ,r);
    }
    void insert(int& now,int last,int l,int r,int pos)
    {
        now = ++ cnt;
        ch[now][]=ch[last][];
        ch[now][]=ch[last][];
        sum[now] = sum[last] + ;
        if(l == r) return ;
        int Mid = (l+r) >> ;
        if(pos <= Mid) insert(ch[now][],ch[last][],l,Mid,pos);
        else insert(ch[now][],ch[last][],Mid + ,r,pos);
    }
    int query(int ss,int tt,int l,int r,int k)
    {
         if(l == r) return l;
         int Mid =(l + r) >> ,tmp = sum[ch[tt][]] - sum[ch[ss][]];
         if(k <= tmp) return query(ch[ss][],ch[tt][],l,Mid,k);
         else return query(ch[ss][],ch[tt][],Mid + ,r,k - tmp);
    }
};
PLTree P;
void _init()
{
    Innum=cnt=;
    sum1=sum2=sum3=;
    memset(c,,sizeof(c));
}
void _scanf()
{
    char chr[];
    for(int i=;i<=n;i++){
        scanf("%s",chr);
        if(chr[]=='I'){
            Qst[i].opt=;
            scanf("%d",&Qst[i].x);
            a[++Innum]=Qst[i].x;
            b[Innum]=a[Innum];
        }
        else {
            Qst[i].opt=chr[]-'';
            if(chr[]=='')   scanf("%d%d%d",&Qst[i].x,&Qst[i].y,&Qst[i].k);
            else   scanf("%d",&Qst[i].k);
        }
    }
}
void _disp()
{
    sort(b+,b+Innum+);
    for(int i=;i<=Innum;i++)
      a[i]=lower_bound(b+,b+Innum+,a[i])-b;
}
void _work()
{
    P.build(P.rt[],,Innum);
    int nowcnt=,ans;
    for(int i=;i<=n;i++){
        if(Qst[i].opt==) {
            nowcnt++;
            P.insert(P.rt[nowcnt],P.rt[nowcnt-],,Innum,a[nowcnt]);
            add(a[nowcnt]);
        }
        else if(Qst[i].opt==){
            ans=P.query(P.rt[Qst[i].x-],P.rt[Qst[i].y],,Innum,Qst[i].k);
            sum1+=b[ans];
        }
        else if(Qst[i].opt==){
            int tmp=sum(lower_bound(b+,b+Innum+,Qst[i].k)-b);
            sum2+=tmp;
        }
        else {
            ans=P.query(P.rt[],P.rt[nowcnt],,Innum,Qst[i].k);
            sum3+=b[ans];
        }
    }
    printf("Case %d:\n",++Case);
    printf("%lld\n%lld\n%lld\n",sum1,sum2,sum3);
}
int main()
{
    while(~scanf("%d",&n)){
        _init();
        _scanf();//输入
        _disp();//离散
        _work();
    }
    return ;
}