这道题还是要先排好序,注意题目的条件,X是从小到大,Y是从大到小,这样就可以将X1 <= X2 && Y2 <= Y1 的范围排好了。注意这里的Y2-Y1 != X2 - X1才可以!!所以要稍微处理一下。这里WA了N发,还是做题不够,老是想到复杂的想不到简单又方便的。
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
struct node {
int x,y,c;
} num[100005];
struct an {
int x,c;
} ans[100005];
int sum[100005];
int lowbit(int t) {
return t & (-t);
}
bool cmp(node a,node b) {
if(a.x == b.x)
return a.y > b.y;
return a.x < b.x;
}
bool ccmp(an a,an b) {
return a.c < b.c;
}
int n;
void add(int t,int v) {
while(t < 100002) {
sum[t] += v;
t += lowbit(t);
}
}
int getsum(int t) {
int s = 0;
while(t) {
s += sum[t];
t -= lowbit(t);
}
return s;
}
int main() {
while(scanf("%d",&n) && n) {
for(int i = 0;i < n;i++) {
scanf("%d %d",&num[i].x,&num[i].y);
num[i].c = i;
}
sort(num,num+n,cmp);
memset(sum,0,sizeof(sum));
memset(ans,-1,sizeof(ans)); //这里如果是0的话,所有的范围完全的相同的话就会出错
/*for(int i = 0;i < n;i++)
printf("%d %d\n",num[i].x,num[i].y);*/
for(int i = 0;i < n;i++) {
if(num[i].x == num[i-1].x && num[i].y == num[i-1].y) //处理相同范围的结果
ans[i].x = ans[i-1].x;
add(num[i].y+1,1);
if(ans[i].x == -1)
ans[i].x = getsum(100001) - getsum(num[i].y) - 1;
ans[i].c = num[i].c;
}
sort(ans,ans+n,ccmp);
for(int i = 0;i < n-1;i++) //排序后按原来的顺序输出
printf("%d ",ans[i].x);
printf("%d\n",ans[n-1].x);
}
}