POJ 2481.Cows【树状数组】【5月10】

最新推荐文章于 2019-09-25 15:05:59 发布

Mr丶Gao

最新推荐文章于 2019-09-25 15:05:59 发布

阅读量471

点赞数

分类专栏：【树状数组】文章标签： C++ ACM POJ 树状数组

本文链接：https://blog.csdn.net/a995549572/article/details/51366503

版权

【树状数组】专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Cows

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 15943		Accepted: 5308

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

Sample Output

1 0 0

有N个区间，求包含当前区间的区间个数：

思路：

将区间按照右端点从大到小排序，比较左端点，树状数组保存，不断维护树状数组：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 100005;
struct ss
{
    int x, y, id;
}cows[MAX];
bool cmp(ss a, ss b)
{
    if(a.y > b.y) return true;
    else if(a.y == b.y && a.x < b.x) return true;
    else return false;
}
int N, maxn, xi, yi, tree[MAX], ans[MAX];
void Insert(int pos)
{
    while(pos <= maxn+1)
    {
        tree[pos] ++;
        pos += pos&(-pos);
    }
}
int Query(int pos)
{
    int sum = 0;
    while(pos > 0)
    {
        sum += tree[pos];
        pos -= pos&(-pos);
    }
    return sum;
}
int main()
{
    while(scanf("%d", &N) != EOF && N)
    {
        maxn = -1;
        memset(ans, 0, sizeof(ans));
        memset(tree, 0, sizeof(tree));
        for(int i = 0;i < N; ++i)
        {
            scanf("%d %d", &xi, &yi);
            cows[i].x = xi+1;
            cows[i].y = yi+1;
            cows[i].id = i+1;
            if(maxn < cows[i].y) maxn = cows[i].y;
        }
        sort(cows, cows+N, cmp);
        Insert(cows[0].x);
        for(int i = 1;i < N; ++i)
        {
            if(cows[i].x == cows[i-1].x && cows[i].y == cows[i-1].y) ans[cows[i].id] = ans[cows[i-1].id];
            else ans[cows[i].id] = Query(cows[i].x);
            Insert(cows[i].x);
        }
        for(int i = 1;i <= N; ++i)
        {
            if(i != 1) cout <<" ";
            cout << ans[i];
        }
        cout << endl;
    }
    return 0;
}