POJ 2481——Cows（树状数组）

Cows

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 12694		Accepted: 4222

Description

Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. 

Farmer John has N cows (we number the cows from 1 to N). Each of Farmer John's N cows has a range of clover that she particularly likes (these ranges might overlap). The ranges are defined by a closed interval [S,E]. 

But some cows are strong and some are weak. Given two cows: cow _i and cow _j, their favourite clover range is [Si, Ei] and [Sj, Ej]. If Si <= Sj and Ej <= Ei and Ei - Si > Ej - Sj, we say that cow _i is stronger than cow _j. 

For each cow, how many cows are stronger than her? Farmer John needs your help!

Input

The input contains multiple test cases. 
For each test case, the first line is an integer N (1 <= N <= 10 ⁵), which is the number of cows. Then come N lines, the i-th of which contains two integers: S and E(0 <= S < E <= 10 ⁵) specifying the start end location respectively of a range preferred by some cow. Locations are given as distance from the start of the ridge. 

The end of the input contains a single 0.

Output

For each test case, output one line containing n space-separated integers, the i-th of which specifying the number of cows that are stronger than cow _i. 

Sample Input

3
1 2
0 3
3 4
0

Sample Output

1 0 0

————————————————分割线——————————————————

题目大意：

给n个区间，求每个区间被包含的数量

思路：

对于区间[x,y] 对y进行从大到小排序，如果y相等则x从小到大排序。

对于某个区间[x,y]，统计前面比x小于等于的点的数量

注意对于区间的判重！还有就是下标要加1，因为起始从0开始

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
#include<utility>
#define M 100000+10
using namespace std;
int c[M],n;
struct node
{
    int x,y,index;
}a[M];
int f[M];
bool cmp(node x,node y)
{
    return (x.y>y.y||(x.y==y.y&&x.x<=y.x));
}
void update(int x,int v)
{
    for(int i=x;i<=M;i+=i&-i){
        c[i]+=v;
    }
}
inline int getsum(int x)
{
    int sum=0;
    for(int i=x;i>0;i-=i&-i){
        sum+=c[i];
    }
    return sum;
}
int main()
{
    while(scanf("%d",&n),n){
        memset(c,0,sizeof(c));
        for(int i=0;i<n;++i){
            scanf("%d %d",&a[i].x,&a[i].y);
            a[i].index=i;
            a[i].x++,a[i].y++;
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n;++i){
            if(i&&a[i].y==a[i-1].y&&a[i].x==a[i-1].x) f[a[i].index]=f[a[i-1].index];
            else f[a[i].index]=getsum(a[i].x);
            update(a[i].x,1);
        }
        for(int i=0;i<n;++i){
            printf("%d",f[i]);
            if(i!=n-1) printf(" ");
        }
        printf("\n");

    }
    return 0;
}