hdu——1541Stars(树状数组)
来源:互联网 发布:手机淘宝一元起拍在哪 编辑:程序博客网 时间:2024/06/02 05:21
Stars
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7522 Accepted Submission(s): 2958
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.
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
Source
Ural Collegiate Programming Contest 1999
Recommend
LL
树状数组是从1开始的 当x=0时会出现问题 所以进行一步x+1将数组平移 但不影响结果 是按照y值排序 即使x相同但是tree【x】的大小不一样
#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>using namespace std;long long nn[33000],mm[33000];long long lowbit(long long n){return n&-n;}void update(long long n,long long m){while(n<32200){nn[n]+=m;n+=lowbit(n);}}long long getsum(long long n){long long sum=0;while(n>0){sum+=nn[n];n-=lowbit(n);}//当n==6时 sum!=nn【6】的值 sum=sum(6)+sum(4) sum==1 所以mm[6]=1;就是算出前n项的和return sum;}int main(){long long n,m,i,k;while(cin>>k){memset(nn,0,sizeof(nn));memset(mm,0,sizeof(mm));for(i=1;i<=k;i++){cin>>n>>m;mm[getsum(n+1)]++;update(n+1,1);}for(i=0;i<k;i++){cout<<mm[i]<<endl;}}return 0;}
0 0
- hdu——1541Stars(树状数组)
- hdu 1541 Stars ( 树状数组 )
- hdu 1541 Stars(树状数组)
- hdu 1541 Stars (树状数组)
- hdu 1541 stars(树状数组)
- HDU 1541 Stars (树状数组)
- HDU 1541 Stars(树状数组)
- hdu 1541 stars (树状数组)
- HDU 1541 Stars(树状数组)
- HDU 1541 Stars (树状数组)
- hdu 1541 Stars(树状数组)
- hdu 1541 Stars(树状数组,思路)
- HDU - 1541 Stars(树状数组)
- HDU:1541 Stars(树状数组)
- 【HDU 1541】Stars(树状数组)
- HDU 1541 Stars(树状数组)
- HDU 1541 Stars(树状数组)
- HDU 1541 Stars【树状数组】
- Android Studio入门到精通
- nginx+mysql+phpmyadmin+svn+python配置
- HTML新型表单的使用
- GUI实现显示当前时间
- springmvc 处理异步请求
- hdu——1541Stars(树状数组)
- 转载:在Ubuntu上安装boa,非常详细
- Android开发艺术探索(研读笔记)——02-Activity的启动模式
- 第八周实践项目3-指向学生类的指针
- 关于在牛客网上做题的解析之数据结构(每日20道题,记录错误和不懂的题)
- 1、SDK、目录结构、adb命令、事件写法
- 顺序表的查找
- [iOS]编译报错:ld: symbol(s) not found for architecture x86_64
- 校园网免流量看视频,上谷歌,脸书,推特