POJ2352 Stars

题目链接：http://poj.org/problem?id=2352

既然题目中说Y坐标是升序给出，那么只需要维护到当前结点的小于X的值，这样很快能求出来所有的等级，然后就balabalabala……

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 32010;
int sum[maxn << 2], ans[15010];
void PushUp(int rt){
	sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void build(int l, int r, int rt){
	sum[rt] = 0;
	if (l == r) return;
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
	PushUp(rt);
}
void update(int x, int l, int r, int rt){
	if (l == r){
		sum[rt] += 1;
		return;
	}
	int m = (l + r) >> 1;
	if (x <= m) update(x, lson);
	else update(x, rson);
	PushUp(rt);
}
int query(int ll, int rr, int l, int r, int rt){
	if (ll <= l && rr >= r) return sum[rt];
	int m = (l + r) >> 1;
	int ret = 0;
	if (ll <= m) ret += query(ll, rr, lson);
	if (rr > m) ret += query(ll, rr, rson);
	return ret;
}
int main(){
	int n;
	while (~scanf("%d", &n)){
		build(0, maxn, 1);
		int x, y;
		for (int i = 0; i < n; i++){
			scanf("%d%d", &x, &y);
			int cnt = query(0, x, 0, maxn, 1);
			ans[cnt] += 1;
			update(x, 0, maxn, 1);
		}
		for (int i = 0; i < n; i++) printf("%d\n", ans[i]);
	}
	return 0;
}

树状数组版：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 32010;
int c[maxn], lev[15010];
int lowbit(int a){
    return a & -a;
}
void add(int a){
    while (a < maxn){
        c[a] += 1;
        a += lowbit(a);
    }
}
int getsum(int a){
    int ret = 0;
    while (a > 0){
        ret += c[a];
        a -= lowbit(a);
    }
    return ret;
}
int main(){
    int n;
    while (~scanf("%d", &n)){
        memset(lev, 0, sizeof(lev));
        memset(c, 0, sizeof(c));
        for (int i = 0; i < n; i++){
            int x, y;
            scanf("%d%d", &x, &y);
            x += 1;
            lev[getsum(x)] += 1;
            add(x);
        }
        for (int i = 0; i < n; i++)
          printf("%d\n", lev[i]);
    }
    return 0;
}