POJ 2481 Cows

 1 const int inf = 0x3f3f3f3f;
 2 const int maxn = 1e5 + 5;
 3 
 4 int bit[maxn], S[maxn], E[maxn], f[maxn];
 5 int n, maxp = 0, anss[maxn];
 6 
 7 int add(int i, int x){
 8     while(i <= maxp){
 9         bit[i] += x;
10         i += (i & -i);
11     }
12     return 0;
13 }
14 int sum(int i){
15     int ans = 0;
16     while(i > 0){
17         ans += bit[i];
18         i -= (i & -i);
19     }
20     return ans;
21 }
22 int cmp(int i, int j){
23     if(E[i] >= E[j]){
24         if(E[i] == E[j]) return S[i] < S[j];
25         else return true;
26     }
27     return false;
28 }
29 
30 int main(){
31     while(scanf("%d", &n) && n != 0){
32         memset(anss, 0, sizeof(anss));
33         memset(bit, 0, sizeof(bit));
34         for(int i = 1; i <= n; i++) {
35             scanf("%d %d", &S[i], &E[i]);
36             S[i]++;
37             E[i]++;
38             maxp = max(maxp, E[i]);
39             f[i] = i;
40         }
41         sort(f + 1, f + n + 1, cmp);
42         int cnt = 0;
43         add(S[f[1]], 1);
44         anss[f[1]] = 0;
45         for(int i = 2; i <= n; i++){
46             int ti = f[i], lai = f[i - 1];
47             if(S[ti] == S[lai] && E[ti] == E[lai]) cnt++;
48             else cnt = 0;
49             int tmans = sum(S[ti]);
50             tmans -= cnt;
51             anss[ti] = tmans;
52             add(S[ti], 1);
53         }
54         for(int i = 1; i <= n; i++){
55             printf("%d", anss[i]);
56             if(i != n) printf(" ");
57             else printf("\n");
58         }
59     }
60 }