树状数组 poj2352 Stars

2019-05-20

22:52:07

加油，坚持，加油，坚持 ！！！

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int MAXN = ;

int c[MAXN],level[MAXN],n;

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

// 求前n项的和
int sum(int n){
    int sum = ;
    while(n > ){
        sum += c[n];
        n -= lowbit(n);
    }
    return sum;
}
// 增加某个元素的大小
void add(int x){
    while(x <= MAXN){
        ++c[x];
        x += lowbit(x);
    }
}

int main(){
    int n,x,y;
    while(~scanf("%d",&n)){
        memset(level, , sizeof(level));
        memset(c, , sizeof(c));
        for(int i=; i<n; ++i) {
            scanf("%d%d",&x,&y);
            ++x;
            level[sum(x)]++;
            add(x);
        }
        for(int i=; i<n; ++i)
            printf("%d\n",level[i]);
    }
    return ;
}