| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 30496 | Accepted: 13316 |
Description
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
初识树状数组，很有帮助，基本结构，算法，操作，
1 /* 2 poj stars 2352 3 by zhh 4 */ 5 #include <iostream> 6 #include <stdio.h> 7 #include <cstring> 8 #include <algorithm> 9 using namespace std; 10 #define maxx 35010 11 #define maxl 32010 12 int c[maxx];//树状数组c 13 int level[maxl]; 14 int lowbit(int x)//c[i]=a[i-2^k+1]中k的值2^k 15 { 16 return x&(-x); 17 } 18 void add(int x,int val)//添加数组值 19 { 20 while(x<maxx) 21 { 22 c[x]+=val; 23 x+=lowbit(x); 24 } 25 } 26 int getsum(int x) 27 { 28 int sum=0; 29 for(int i=x;i>0;i-=lowbit(i)) 30 { 31 sum+=c[i]; 32 } 33 return sum; 34 } 35 int main() 36 { 37 int n; 38 while(scanf("%d",&n)!=EOF) 39 { 40 memset(c,0,sizeof(c)); 41 memset(level,0,sizeof(level)); 42 for(int i=0;i<n;i++) 43 { 44 int x,y; 45 scanf("%d %d",&x,&y); 46 x++;//避免x为0的情况 47 int leve=getsum(x); 48 level[leve]++; 49 add(x,1); 50 } 51 for(int i=0;i<n;i++) 52 printf("%d ",level[i]); 53 } 54 }