hdoj1541Stars【树状数组】

原创 2015年11月21日 17:26:56

Stars

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6775    Accepted Submission(s): 2698


Problem 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.
 

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
 

Source
 
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=32010;
int c[maxn+10];
int vis[maxn+10];
int N;
int low(int n){
	return n&(-n);
}
void add(int p,int q){
	while(p<=maxn){
		c[p]+=q;
		p+=low(p);
	}
}
int sum(int n){
	int value=0;
	while(n>0){
		value+=c[n];
		n-=low(n);
	}
	return value;
}
int main()
{
	int i,j,k,ans,num;
	while(scanf("%d",&N)!=EOF){
		memset(c,0,sizeof(c));
		memset(vis,0,sizeof(vis));
		for(i=1;i<=N;++i){
			scanf("%d%d",&num,&ans);
			vis[sum(num+1)]++;
			add(num+1,1);
		}
		for(i=0;i<N;++i){
			printf("%d\n",vis[i]);
		}
	}
	return 0;	
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

hdoj1541 stars 树状数组

Problem Description Astronomers often examine star maps where stars are represented by points on a ...
  • kyoma
  • kyoma
  • 2016年08月03日 21:05
  • 244

hdu3792(Twin Prime Conjecture) and hdu1541(Stars)树状数组

本题的大致题意为在n的范围内,找有ji dui

hdu1541 Stars(树状数组+解释)

http://acm.hdu.edu.cn/showproblem.php?pid=1541 题意:有n个星星,输入时是以从下到上,从左到右的方式输入(x,y)的值。每个星星左下方有多少个星星就...

树状数组题目---HDU 1541 stars 及其变形(降维思想)

1. HDU1541  Stars 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1541 题意:大概就是计算每颗星星左下方包括了多少颗星星,这个数值就...

HDU1541 Stars(树状数组)

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
  • d_x_d
  • d_x_d
  • 2016年02月28日 13:32
  • 1093

hdu 1541 Stars(树状数组)

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Su...

ACM-树状数组之Stars——hdu1541,poj2352

ACM 树状数组 Stars hdu1541 poj2352

HDU:1541 Stars(树状数组)

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Su...
  • zugofn
  • zugofn
  • 2016年08月18日 20:17
  • 114

poj 2352 && hdu 1541 Stars (树状数组)

Stars                                                                             Time Limit: 2000/...

hdu 1541 Stars 入门 树状数组

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Su...
  • LZK1997
  • LZK1997
  • 2017年07月31日 08:36
  • 73
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj1541Stars【树状数组】
举报原因:
原因补充:

(最多只允许输入30个字)