# POJ2481 Cows

Cows
 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 11946 Accepted: 3942

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 5), 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 5) 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.

Source

POJ Contest,Author:Mathematica@ZSU

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=100010;
int c[MAX];
int count1[MAX];
struct Node
{
int s,e;
int id;
}p[MAX];
bool cmp(Node a,Node b)
{
if(a.e==b.e)
return a.s<b.s;
return a.e>b.e;
}
int lowbit(int x)
{
return x&(-x);
}
{
while(x<MAX)
{
c[x]+=val;
x+=lowbit(x);
}
}
int sum(int x)
{
int ans=0;
while(x>0)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int main()
{
int n,i;
while(scanf("%d",&n)==1&&n)
{
for(i=1;i<=n;i++)
{
scanf("%d%d",&p[i].s,&p[i].e);
p[i].id=i;
}
sort(p+1,p+n+1,cmp);
memset(c,0,sizeof(c));
for(i=1;i<=n;i++)
{
p[i].s++;
if(p[i].s==p[i-1].s&&p[i].e==p[i-1].e)          //注意这里
count1[p[i].id]=count1[p[i-1].id];
else
count1[p[i].id]=sum(p[i].s);
}
printf("%d",count1);
for(i=2;i<=n;i++)
{
printf(" %d",count1[i]);
}
printf("\n");
}
return 0;
}


03-18 135
02-07 399
09-24 242
03-03 431
04-07 386
09-20
09-19
02-23 79
04-15 1113
12-18 654
01-15 381
07-08 585
12-04

### “相关推荐”对你有帮助么？

•  非常没帮助
•  没帮助
•  一般
•  有帮助
•  非常有帮助 被折叠的  条评论 为什么被折叠? 到【灌水乐园】发言   eeeaaaaa

¥1 ¥2 ¥4 ¥6 ¥10 ¥20 获取中  扫码支付 点击重新获取   扫码支付 1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。 余额充值