poj 2352, 线段树
2013-11-07 15:59
169 查看
Stars
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
Sample Output
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
Source
Ural Collegiate Programming Contest 1999
线段树水题,与poj 2299类似算法。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 28219 | Accepted: 12368 |
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.
Source
Ural Collegiate Programming Contest 1999
线段树水题,与poj 2299类似算法。
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<vector> #include<set> #include<queue> #include<string> #include<cmath> #include<fstream> #include<iomanip> using namespace std; #define LL long long #define lson rt<<1, l, m #define rson rt<<1|1, m, r #define MAXN 33000 #define cint const int int ocr[MAXN<<2], n; int query(int rt, int l, int r, cint cl, cint cr){ if(l>=cl && r<=cr) return ocr[rt]; int m = l + r >> 1, ret = 0; if(m > cl) ret += query(lson, cl, cr); if(m < cr) ret += query(rson, cl, cr); return ret; } void update(int rt, int l, int r, cint x){ ocr[rt]++; if(l+1 == r) return; int m = l + r >> 1; if(m > x) update(lson, x); else update(rson, x); } int ans[MAXN]; int main(){ // freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin); while(scanf(" %d", &n)==1){ int x, y; fill_n(ocr+1, 32000<<2, 0); fill_n(ans, n, 0); for(int i=0; i<n; i++){ scanf(" %d %d", &x, &y); x++; ans[query(1, 1, 32002, 1, x+1)]++; update(1, 1, 32002, x); } for(int i=0; i<n; i++) printf("%d\n", ans[i]); } return 0; }
相关文章推荐
- POJ 2352 Stars 线段树 单点更新 成段求和
- POJ 2352-Stars(线段树)
- poj_2352 线段树
- poj 2352 stars 线段树
- POJ 2352 Stars (线段树)
- POJ 2352 Stars 线段树
- poj 2352 Stars(线段树||树状数组)
- PKU 2352 POJ 2352 Stars ( 线段树版 ) ACM 2352 IN PKU
- poj2352-------------线段树------------(*)
- 线段树 POJ 2352
- Poj2352-树状数组或线段树
- POJ 2352 Stars (线段树)
- POJ 2352 Stars(树状数组||线段树单点更新)
- POJ 2352 树状数组(线段树)
- poj 2352 线段树
- POJ 2352 线段树(单点更新)
- poj 2352 线段树
- POJ 2352 Stars(线段树)
- POJ 2352 Stars(线段树单点更新)
- POJ 2352 Stars 线段树 pascal