题目链接:http://poj.org/problem?id=2352
题目描述:给定n个星星的(x,y)坐标,定义每个星星(x,y)的level值为在左下角的星星(x0 <= x, y0 <= y)数量。求level值为0~n-1的星星数量。星星坐标按y值递增顺序给出,若y值相同,按x值递增顺序。
思路:输入保证了y值一定是非递减的,这样只要考虑x值就好,对于第i个星星,计算其前面(i - 1)个星星中x值小于它的星星数量就是其level值。用树状数组更新值和求和即可。
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<sstream>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 32000 + 10;
const int maxt = 300 + 10;
const int mod = 10;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int Dis[] = {-1, 1, -5, 5};
const int inf = 0x3f3f3f3f;
const int MOD = 1000;
int n, m, k;
int tree[maxn], level[maxn];
inline int lowbit(int x){
return x & -x;
}
void update(int x, int num){
while(x < maxn){
tree[x] += num;
x += lowbit(x);
}
}
int getsum(int x){
int sum = 0;
while(x >= 1){
sum += tree[x];
x -= lowbit(x);
}
return sum;
}
int main(){
scanf("%d", &n);
memset(tree, 0, sizeof tree);
memset(level, 0, sizeof level);
int x, y;
for(int i = 1; i <= n; ++i){
scanf("%d%d", &x, &y);
++x;//x输入可能为0,故对其进行加1操作
++level[getsum(x)];//统计小于坐标x的x值数量,即为第i颗星星的level,对其进行加一操作记录个数
update(x, 1);//x位置星星数量加一
}
for(int i = 0; i < n; ++i){
printf("%d\n", level[i]);
}
return 0;
}