POJ 2352 Stars
来源:互联网 发布:linux上安装jira 编辑:程序博客网 时间:2024/05/05 17:56
Stars
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23114 Accepted: 10077
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
51 15 17 13 35 5
Sample Output
12110
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
树状数组
树状数组
#include<stdio.h>#include<string.h>#define MAXN 32002int c[MAXN];int s[MAXN];int lowbit(int x){ return x&(-x);}void update(int x){ while(x<MAXN) { c[x]++; x+=lowbit(x); }}int sum(int end){ int s=0; while(end>0) { s+=c[end]; end-=lowbit(end); } return s;}int main(void){ int N,i,x,y,k;// memset(c,0,sizeof(c));// memset(s,0,sizeof(s)); scanf("%d",&N); for(i=1;i<=N;i++) { scanf("%d%d",&x,&y); update(x+1); k=sum(x+1)-1; s[k]++; } for(i=0;i<N;i++) { printf("%d\n",s[i]); } return 0;}
- POJ 2352 STARS
- POJ 2352 Stars
- Poj 2352 Stars
- poj 2352 Stars
- poj 2352 Stars
- poj 2352 Stars
- POJ 2352 Stars
- POJ 2352 Stars
- POJ-2352-Stars
- POJ 2352 Stars
- Poj 2352 Stars 题解
- poj 2352 stars
- POJ 2352 stars
- POJ 2352 - Stars
- POJ 2352 Stars
- POJ 2352 Stars
- poj 2352 Stars
- poj 2352 Stars
- Android Intent Action 大全(转)
- HDU 2065
- ssh服务器启动和客户端常用操作(转)
- 转:s3c2440对nandflash的操作(K9F2G08)
- 蛋疼的主从 MySQL Event
- POJ 2352 Stars
- Android 文件存放路径
- ssh服务器公钥记录文件(转)
- TCP连接的建立过程
- 家庭影院.液晶电视.常见接口介绍
- 词语洁癖
- poj 1002
- ssh服务器配置
- import project后,出现Unable to get system library for the project