codeforce/652/D Nested Segments （权值线段树）

题目：http://codeforces.com/problemset/problem/652/D

题意：给n个片段，求每个片段内完全包含的段的个数。

思路：先按左端点排序，每次找右边的小于当前数的个数即为答案，从右向左每次查找更新即可。由于数据太大，离散化。

代码：

#include <bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
using namespace std;
const int maxn = 2e5+5;

int n, len, sum[maxn<<2];
struct Node{
    int x, y, id;
}node[maxn], ans[maxn];
bool cmp1(Node a, Node b){return a.x < b.x;}
bool cmp2(Node a, Node b){return a.id < b.id;}

vector<int>vec;
int getid(int x){return lower_bound(vec.begin(), vec.end(), x)-vec.begin()+1;}
void update(int rt, int l, int r, int pos){
    if(l == r) {sum[rt] ++; return ;}
    int mid = l+r >> 1;
    if(pos <= mid) update(ls, l, mid, pos);
    else update(rs, mid+1, r, pos);
    sum[rt] = sum[ls] + sum[rs];
}
int query(int rt, int l, int r, int val){
    if(l == r) return sum[rt];
    int mid = l+r >> 1, res = 0;
    if(val <= mid) res += query(ls, l, mid, val);
    else res += sum[ls] + query(rs, mid+1, r, val);
    return res;
}
int main()
{
    while(cin >> n){
        vec.clear(); memset(sum, 0, sizeof sum);
        for(int i=1; i<=n; i++) cin >> node[i].x >> node[i].y, node[i].id = i, vec.push_back(node[i].y);
        sort(node+1, node+n+1, cmp1); sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end()), len = vec.size();
        for(int i=n; i>=1; i--){
            ans[i].id = node[i].id;
            ans[i].x = query(1, 1, len, getid(node[i].y));
            update(1, 1, len, getid(node[i].y));
        }
        sort(ans+1, ans+n+1, cmp2);
        for(int i=1; i<=n; i++) cout << ans[i].x << endl;
    }
}