poj 2481 Cows

E - Cows

Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

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
x 按升序，y按降序 sort一下
x1,y1
x2,y2
如果x1==x2,y1==y2的话，sum(x2,y2)=sum(x1,y1),不能用getnum()去求覆盖(x2,y2)的区间个数
1 2
1 2 
1 2 
用getnum（）去求第三个（1,2）的话，会得到2，但是结果应该为0

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cstring>
#include<stdlib.h>
#include<string>
#include<cmath>
using namespace std;
#define pb push_back
int n,m,k,mmax;
int p[100100],check[100100];
struct node{
    int x,y,id;
}num[101000];
int cmp(node a,node b){
    if(a.x==b.x) return a.y>b.y;
    return a.x<b.x;
}
void update(int pos){
    while(pos>=1){
        p[pos]+=1;
        pos-=pos&(-pos);
    }
}
int getnum(int pos){
    int sum=0;
    while(pos<=mmax){
        sum+=p[pos];
        pos+=pos&(-pos);
    }
    return sum;
}
int main(){
    while(scanf("%d",&n),n){
        memset(p,0,sizeof(p));
        memset(check,0,sizeof(check));
        mmax=0;
        for(int i=1;i<=n;i++){
             scanf("%d%d",&num[i].x,&num[i].y);
             num[i].x++,num[i].y++;
             num[i].id=i;
             mmax=max(mmax,num[i].y);
        }
        sort(num+1,num+1+n,cmp);
        check[num[1].id]=0;
        update(num[1].y);
        for(int i=2;i<=n;i++){
            if(num[i].x==num[i-1].x&&num[i].y==num[i-1].y)
                check[num[i].id ]=check[num[i-1].id ];
            else
                check[num[i].id ]=getnum(num[i].y);
            update(num[i].y);
        }
        for(int i=1;i<=n;i++){
            if(i!=1) printf(" ");
            printf("%d",check[i]);
        }
        printf("
");
    }
}