HDU 4417 Super Mario （划分树）（二分）

Super Mario

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6077    Accepted Submission(s): 2645

Problem Description

Mario
is world-famous plumber. His “burly” figure and amazing jumping ability
reminded in our memory. Now the poor princess is in trouble again and
Mario needs to save his lover. We regard the road to the boss’s castle
as a line (the length is n), on every integer point i there is a brick
on height hi. Now the question is how many bricks in [L, R] Mario can
hit if the maximal height he can jump is H.

 

Input

The first line follows an integer T, the number of test data.
For each test data:
The
first line contains two integers n, m (1 <= n <=10^5, 1 <= m
<= 10^5), n is the length of the road, m is the number of queries.
Next line contains n integers, the height of each brick, the range is [0, 1000000000].
Next m lines, each line contains three integers L, R,H.( 0 <= L <= R < n 0 <= H <= 1000000000.)

 

Output

For
each case, output "Case X: " (X is the case number starting from 1)
followed by m lines, each line contains an integer. The ith integer is
the number of bricks Mario can hit for the ith query.

 

Sample Input

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

 

Sample Output

Case 1:
4
0
0
3
1
2
0
1
5
1

【分析】给你一系列数，求给定区间内不大于h的数的个数。直接二分枚举位置然后划分树查找就行了。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#define met(a,b) memset(a,b,sizeof a)
#define pb push_back
#define lson(x) ((x<<1))
#define rson(x) ((x<<1)+1)
using namespace std;
typedef long long ll;
const int N=1e5+;
const int M=N*N+;
long long ans;
struct P_Tree {
    int n;
    int tree[][N];
    int sorted[N];
    int toleft[][N];
    ll sum[N];
    ll lsum[][N];

    void init(int len) {
        n=len;
        sum[]=;
        for(int i=; i<; i++)tree[i][]=toleft[i][]=lsum[i][]=;
        for(int i=; i<=n; i++) {
            scanf("%d",&sorted[i]);
            tree[][i]=sorted[i];
            sum[i]=sum[i-]+sorted[i];
        }
        sort(sorted+,sorted+n+);
        build(,n,);
    }
    void build(int l,int r,int dep) {
        if(l==r)return;
        int mid=(l+r)>>;
        int same=mid-l+;
        for(int i=l; i<=r; i++) {
            if(tree[dep][i]<sorted[mid])
                same--;
        }
        int lpos = l;
        int rpos = mid+;
        for(int i = l; i <= r; i++) {
            if(tree[dep][i] < sorted[mid]) {
                tree[dep+][lpos++] = tree[dep][i];
                lsum[dep][i] = lsum[dep][i-] + tree[dep][i];
            } else if(tree[dep][i] == sorted[mid] && same > ) {
                tree[dep+][lpos++] = tree[dep][i];
                lsum[dep][i] = lsum[dep][i-] + tree[dep][i];
                same --;
            } else {
                tree[dep+][rpos++] = tree[dep][i];
                lsum[dep][i] = lsum[dep][i-];
            }
            toleft[dep][i] = toleft[dep][l-] + lpos -l;
        }
        build(l,mid,dep+);
        build(mid+,r,dep+);
    }

    int query(int L,int R,int l,int r,int dep,int k) {
        if(l==r)return tree[dep][l];
        int mid=(L+R)>>;
        int cnt=toleft[dep][r]-toleft[dep][l-];
        int s=toleft[dep][l-]-toleft[dep][L-];
        if(cnt>=k) {
            int newl=L+toleft[dep][l-]-toleft[dep][L-];
            int newr=newl+cnt-;
            return query(L,mid,newl,newr,dep+,k);//×¢Òâ
        } else {
            ans+=(ll)(lsum[dep][r]-lsum[dep][l-]);
            //printf("l:  %d   r:   %d  ans:  %lld   %lld  %lld\n",l,r,ans,lsum[dep][r],lsum[dep][l-1]);
            int newr=r+toleft[dep][R]-toleft[dep][r];
            int newl=newr-(r-l-cnt);
            return query(mid+,R,newl,newr,dep+,k-cnt);//×¢Òâ
        }
    }
} tre;
int main() {
    int iCase=;
    int n,m,k,T;
    int l,r,h;
    scanf("%d\n",&T);
    while(T--) {
        scanf("%d%d",&n,&m);
        tre.init(n);
        printf("Case %d:\n",++iCase);
        while(m--) {
            int Ans=;
            ans=;
            scanf("%d%d%d",&l,&r,&h);
            l++;
            r++;
            int ll=,rr=(r-l)+;
            while(rr-ll>=){
                k=(rr+ll)/;
                int res=tre.query(,n,l,r,,k);
                if(res>h)rr=k-;
                else {
                    Ans=k;
                    ll=k+;
                }
                //printf("l: %d r: %d k: %d ans: %d\n",l,r,k,Ans);system("pause");
            }
            printf("%d\n",Ans);
        }
    }
    return ;
}