Stars(树状数组)
来源:互联网 发布:淘宝网开通账户 编辑:程序博客网 时间:2024/06/17 14:07
题目链接
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
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
树状数组
1.利用了二进制,类似于二分法
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int c[32010];//树状数组的c数组int cnt[32010];int sum(int x){ int s = 0; while(x>0){ s +=c[x]; x -= x&-x; } return s;}void updata(int x,int val){ while(x<=32010){ c[x] += val; x += x&-x; }}int main(){ int N; scanf("%d",&N); memset(c,0,sizeof(c)); memset(cnt,0,sizeof(cnt)); for(int i = 0;i<N;i++){ int x, y; scanf("%d%d",&x,&y); //sum类似与建树,构造树状数组的数据结构 int count = sum(x+1);//防止x==0的情况 cnt[count]++; updata(x+1,1); } for(int i = 0;i<N;i++) printf("%d\n",cnt[i]); return 0;}
- PKU2352 Stars - 树状数组
- poj_2352 Stars (树状数组)
- 【树状数组】 poj2352 Stars
- Pku2352 Stars 树状数组
- Stars(树状数组)
- POJ2352 stars(树状数组)
- hdu1541 Stars (树状数组)
- poj2352 - Stars(树状数组)
- Stars(树状数组)
- Stars(树状数组)
- poj2352 Stars 树状数组
- Stars -树状数组
- hdu1541 Stars 树状数组
- HDU1541 Stars【树状数组】
- POJ2352:Stars(树状数组)
- hdu1541-Stars(树状数组)
- Stars(树状数组)
- HDU1541 Stars 树状数组
- MongodbTemplate的查询操作
- 10.5日常总结
- 前端实用工具及其js相关功能的类库总结
- 信号量处理相关函数
- 顺序表筛选数据的应用
- Stars(树状数组)
- socket通信
- excel实现分组
- 从输入URL到页面显示发生了什么
- 犯罪嫌疑人--逻辑推理
- Java比较器
- ServletConfig和ServletContext的意思
- 无缝滚动效果
- 【DBSDFZOJ 4460】666(DP)