HDU 4325-Flowers（线段树+离散化）

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<1|1
#define All 1,N,1
#define N 100010
#define read freopen("in.txt", "r", stdin)
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int res[N*8],q[N],sl[N],er[N];
ll sum[N*8],add[N*8],total;
void pushup(int rt){
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void pushdown(int rt,int len){
    if(add[rt]){
        add[rt<<1]+=add[rt];
        add[rt<<1|1]+=add[rt];
        sum[rt<<1]+=1LL*(len-len/2)*add[rt];
        sum[rt<<1|1]+=1LL*(len/2)*add[rt];
        add[rt]=0;
    }
}
void build(int l,int r,int rt){
    sum[rt]=add[rt]=0;
    if(l==r)return;
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    //pushup(rt);
}
void update(int L,int R,int v,int l,int r,int rt){
    if(L<=l&&R>=r){
        add[rt]+=v;
        sum[rt]+=(r-l+1)*v;
        return;
    }
    pushdown(rt,r-l+1);
    int m=(l+r)>>1;
    if(L<=m)update(L,R,v,lson);
    if(R>m)update(L,R,v,rson);
    pushup(rt);
}
ll query(int v,int l,int r,int rt){
        if(l==r){
            return sum[rt];
        }
    pushdown(rt,r-l+1);
    int m=(l+r)>>1;
    if(v<=m)return query(v,lson);
    else return query(v,rson);
}
int main()
{
    int t,n,m,test=0;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        int len=0;
        for(int i=0;i<n;++i){
            scanf("%d%d",&sl[i],&er[i]);
            res[++len]=sl[i];
            res[++len]=er[i];
        }
        for(int i=0;i<m;++i){
            scanf("%d",&q[i]);
            res[++len]=q[i];
        }
        sort(res+1,res+len+1);
        int tmp=unique(res+1,res+len+1)-(res+1);
        for(int i=tmp;i>=2;i--)
        {
            if(res[i]!=res[i-1]+1)res[++tmp]=res[i-1]+1;
        }
        sort(res+1,res+tmp+1);
        build(1,tmp,1);
        for(int i=0;i<n;++i){
            int ll=lower_bound(res+1,res+tmp+1,sl[i])-res;
            int rr=lower_bound(res+1,res+tmp+1,er[i])-res;
            update(ll,rr,1,1,tmp,1);
        }
        printf("Case #%d:\n",++test);
       for(int i=0;i<m;++i){
            int p=lower_bound(res+1,res+tmp+1,q[i])-res;
            printf("%I64d\n",query(p,1,tmp,1));
        }
    }
return 0;
}