poj2481

                                                                                              Cows

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 10236		Accepted: 3351

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.

 

 

#include
#include
#include
#include
using namespace std;
const int maxn = 100005;
int c[maxn];
struct Node
{
    int left,right;
    int thesome;
}tree[maxn];
bool cmp(Node &a,Node &b)
{
    if(a.right == b.right)
        return a.left < b.left;
    else 
        return a.right > b.right;
}
int lowbit(int x)
{
    return x & -x;
}
int sum(int x)
{
    int sum1 = 0;
    while(x>0)
    {
        sum1 += c[x];
        x -= lowbit(x);
    }    

    return sum1;
}

void add(int x,int d)
{
    while(x<maxn)
    {
        c[x] += d;
        x += lowbit(x);
    }
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF && n)
    {
        int i;
        memset(c,0,sizeof(c));
        int ans[maxn];
        for(i=0;i)
        {
            scanf("%d %d",&tree[i].left,&tree[i].right);
            tree[i].left++;
            tree[i].right++;
            tree[i].thesome = i;
        }
        sort(tree,tree+n,cmp);
        memset(ans,0,sizeof(ans));
        for(i=0;i)
        {
            if(i>0 && tree[i].left == tree[i-1].left && tree[i].right == tree[i-1].right)
            {
                ans[tree[i].thesome] = ans[tree[i-1].thesome];
            }
            else 
            {
                ans[tree[i].thesome] = sum(tree[i].left);
            }
            add(tree[i].left,1);
        }
        
        for(i=0;i1;i++)
            printf("%d ",ans[i]);
        printf("%d\n",ans[n-1]);
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/Deng1185246160/p/3252314.html