Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronomers want to know the distribution of the levels of the stars.
For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.
You are to write a program that will count the amounts of the stars of each level on a given map.
For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.
You are to write a program that will count the amounts of the stars of each level on a given map.
Input
The first line of the input file contains a number of stars N (1<=N<=15000). The following N lines describe coordinates of stars (two integers X and Y per line separated by a space, 0<=X,Y<=32000). There can be only one star at one point of the plane. Stars are listed in ascending order of Y coordinate. Stars with equal Y coordinates are listed in ascending order of X coordinate.
Output
The output should contain N lines, one number per line. The first line contains amount of stars of the level 0, the second does amount of stars of the level 1 and so on, the last line contains amount of stars of the level N-1.
Sample Input
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
思路: 输入已经在y方向排序,故只需按x方向求解累加和即可。采用树状数组。对输入的x,求累加和得到level,之后update,每次update++.
//树状数组 求累加和 #include <iostream> #include <string.h> using namespace std; int a[15005]; int c[32005]; //获取2^k int lowbit(int x) { return x&(-x); } //求累加和 int sum(int n) { int s = 0; while(n>0) { s += c[n]; n -= lowbit(n); } return s; } //更新 void update(int x, int delta=1) { while(x < 32005) { c[x] += delta; x += lowbit(x); } } int main() { #ifdef DEBUG freopen("input/file mapping C.txt", "r", stdin); #endif int N; scanf("%d", &N); memset(a, 0, sizeof(a)); memset(c, 0, sizeof(c)); for(int i = 0; i < N; i ++) { int x, y; scanf("%d%d", &x, &y); a[sum(++x)]++; update(x); } for(int i = 0; i < N; i ++) { printf("%d\n", a[i]); } }