树状数组，模版题。。直接按给定的顺序统计比当前X小于等于的星星个数即可。
[cpp] #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long LL; #define EPS 10e-9 #define INF 0x3f3f3f3f #define REP(i,n) for(int i=0; i<(n); i++) const int maxn = 40000; int c[maxn]; int ans[maxn]; int lowbit(int x) { return x&-x; } void add(int x){ while(x c[x]+=1; x+=lowbit(x); } } www.2cto.com int sum(int x){ int ret=0; while(x>0){ ret+=c[x]; x-=lowbit(x); } return ret; } int main(){ int n,x,y; while(scanf("%d",&n)!=EOF){ memset(ans,0,sizeof(ans)); for(int i=0;i scanf("%d %d",&x,&y); x++;y++; ans[ sum(x)]++; add(x); } for(int i=0;i printf("%d\n",ans[i]); } return 0; }