hdu 1541 Stars

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1541

题目大意:给定了星星的坐标(按y从升序,y相同的,按x升序),求星星的等级,星星的等级等于它左下角(包括正下和正左)的星星数.

题目思路:以星星的x坐标建立线段树或树状数组,先查询后更新.

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ull unsigned __int64
#define ll __int64
//#define ull unsigned long long
//#define ll long long
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define middle (l+r)>>1
#define MOD 9901
#define esp (1e-10)
const int INF=0x3F3F3F3F;
//const double pi=acos(-1.0);
const int N=32010,M=15010;
int n,m;
int sum[N],cnt[M];
struct node{
	int x,y;
	void write(){
		scanf("%d%d",&x,&y);x++;
	}
}a[M];

int lowbit(int x){return x&(-x);}

void Add(int pos,int c){
	while(pos<=m) sum[pos]+=c,pos+=lowbit(pos);
}

int Sum(int pos){
	int r=0;
	while(pos>0) r+=sum[pos],pos-=lowbit(pos);
	return r;
}

int main(){
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	int i,j,k;
	//int T,cas;scanf("%d",&T);for(cas=1;cas<=T;cas++)
	while(~scanf("%d",&n)){
		for(i=m=0;i<n;i++){
			a[i].write();
			if(m<a[i].x) m=a[i].x;
		}
		memset(sum,0,sizeof(sum));
		memset(cnt,0,sizeof(cnt));
		for(i=0;i<n;i++){
			cnt[Sum(a[i].x)]++;
			Add(a[i].x,1);
		}
		for(i=0;i<n;i++) printf("%d\n",cnt[i]);
	}
	return 0;
}