标签：技术分享 node poj stars ane cee numbers use present
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.Input
Output
Sample Input
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
Hint
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 6 using namespace std; 7 8 const int maxn=15005; 9 int g[maxn],d[maxn],n; 10 11 struct node 12 { 13 int x,y; 14 int y1; 15 }c[maxn]; 16 17 void update(int x) 18 { 19 for(;x<=n;x+=x&(-x)) 20 g[x]++; 21 } 22 23 int getsum(int x) 24 { 25 int sum=0; 26 for(;x>0;x-=x&(-x)) 27 sum+=g[x]; 28 return sum; 29 } 30 31 bool cmpx(node xx,node yy) 32 { 33 if(xx.x!=yy.x) 34 return xx.x<yy.x; 35 return xx.y<yy.y; 36 } 37 38 bool cmpy(node xx,node yy) 39 { 40 if(xx.y!=yy.y) 41 return xx.y<yy.y; 42 return xx.x<yy.x; 43 } 44 45 int main() 46 { 47 while(~scanf("%d",&n)) 48 { 49 for(int i=1;i<=n;i++) 50 scanf("%d%d",&c[i].x,&c[i].y); 51 52 sort(c+1,c+n+1,cmpy); 53 for(int i=1;i<=n;i++) 54 c[i].y1=i; 55 sort(c+1,c+n+1,cmpx); 56 memset(g,0,sizeof(g)); 57 memset(d,0,sizeof(d)); 58 long long ans=0; 59 for(int i=1;i<=n;i++) 60 { 61 d[getsum(c[i].y1)]++; 62 update(c[i].y1); 63 } 64 for(int i=0;i<n;i++) 65 printf("%d\n",d[i]); 66 } 67 68 return 0; 69 }
标签：技术分享 node poj stars ane cee numbers use present
原文地址：http://www.cnblogs.com/xibeiw/p/7371380.html
