经典指数          
POJ
原因
454
浏览数
0
收藏数
 

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.输入描述 The first line of the input file contains a number of stars N (1输出描述 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.输入例子 5 1 1 5 1 7 1 3 3 5 5 输出例子 1 2 1 1 0 Hint This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

     举报   纠错  
 
切换
1 个答案
链接:https://www.nowcoder.com/questionTerminal/0a4a24a9596349f1a1a84db187a3fd2b 来源:牛客网 #include #include #include #define mid ((left+right)>>1) #define lson rt<<1,left,mid #define rson rt<<1|1,mid+1,right usingnamespacestd;   constintMAXN = 32005;   intsum[MAXN<<2],level[MAXN<<2];   voidupdate(intrt,intleft,intright,intdata){     ++sum[rt];     if(left==right)return;     if(data <= mid) update(lson,data);     elseupdate(rson,data); } intquery(intrt,intleft,intright,intl,intr){     if(left==l && right==r) {         returnsum[rt];     }     intm = mid;     if(r <= m)returnquery(lson,l,r);     elseif(l > m)returnquery(rson,l,r);     elsereturnquery(lson,l,m)+query(rson,m+1,r); }   intmain(){     intn,x,y;     while(~scanf("%d",&n)){         memset(sum, 0,sizeof(sum));         memset(level, 0,sizeof(level));         for(inti=0; i
 
切换
撰写答案
扫描后移动端查看本题