POJ 2481 Cows【树状数组 变相求逆序对】

Cows

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 20617		Accepted: 7004

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

Hint

Huge input and output,scanf and printf is recommended.

题意，按照输入顺序，输出该区间是多少个区间的真子集！！！

思路：

和Star题比较像，首先都要先排序，按照左区间从大到小顺序排序；

如果左区间相同则按右区间从小到大排序，这样就可以将此题转换为右区间的正序对数量；

但是排序是要注意该元素的序列号，所以在结构体里单独加一个id，以记录序列号；

详见代码；

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX = 1e5 + 7;
int c[MAX], ans[MAX];
struct node
{
    int x, y, id;
    friend bool operator < (node a, node b)
    {
        if(a.x == b.x)
            return a.y < b.y;
        return a.x > b.x;
    }
} a[MAX];
int lowbit(int i)
{
    return i & -i;
}
void add(int i, int num)
{
    while(i < MAX)
    {
        c[i] += num;
        i += lowbit(i);
    }
}
int Sum(int i)
{
    int sum = 0;
    while(i > 0)
    {
        sum += c[i];
        i -= lowbit(i);
    }
    return sum;
}
int main()
{
    int n;
    while(~scanf("%d", &n) && n)
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d", &a[i].x, &a[i].y);
            a[i].x++;
            a[i].y++;
            a[i].id = i;
        }
        sort(a, a + n);
        memset(c, 0, sizeof c);
        memset(ans, 0, sizeof ans);
        for(int i = n - 1; i >= 0; i--)
        {
            int maxn = Sum(a[i].y);
            if(i + 1 < n && a[i].x == a[i + 1].x && a[i].y == a[i + 1].y)
                ans[a[i].id] = ans[a[i + 1].id];
            else
                ans[a[i].id] = n - 1 - i - maxn;
            add(a[i].y + 1, 1);///敲黑板：划重点！！a[i].y + 1!!!!题干要求是真子集！真子集！真子集！
        }
        for(int i = 0; i < n; i++)
        {
            if(i == n - 1)
                printf("%d\n", ans[i]);
            else
                printf("%d ", ans[i]);
        }
    }
    return 0;
}