# 关于我们

## 新闻公告

< 返回

### 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: cowi and cowj, their favourite clover range is [Si, Ei] and [Sj, Ej]. If Si <= Sj and Ej <= Ei and Ei - Si > Ej - Sj, we say that cowi is stronger than cowj

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 <= 105), which is the number of cows. Then come N lines, the i-th of which contains two integers: S and E(0 <= S < E <= 105) 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 cowi

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<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
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;
}

{
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<n;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<n;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);
}
}

for(i=0;i<n-1;i++)
printf("%d ",ans[i]);
printf("%d
",ans[n-1]);
}
return 0;
}``````

/template/Home/Dawn/PC/Static