Poj2352 stars (tree array)

Source: Internet
Author: User
Stars
Time limit:1000 ms   Memory limit:65536 K
Total submissions:32473   Accepted:14184

Description

Astequalmers 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. astpolicmers 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 shoshould 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.
After learning about the tree array, I feel very convenient. I can solve some of the problems of the line tree. I learned the blog of maple leaf with tears and explained it very well. Worship the gods ....
# Include <iostream> # include <cstdio> # include <cstdlib> # include <cstring> # include <algorithm> # include <cmath> # define Init (a) memset (, 0, sizeof (A) using namespace STD; # define Max int_max # define min int_min # define ll _ int64 # define lson l, m, RT <1 # define rson m + 1, R, RT <1 | 1 const int maxn = 50010; using namespace STD; int C [maxn]; int lev[ maxn]; int lowbit (int x) {return X & (-x);} void add (int I, int W) // increase or decrease {While (I <= 32010) {C [I] + = W; I + = lowbit (I );}} int sum (int I) // calculation interval and {int S = 0; while (I> 0) {S + = C [I]; I = I-lowbit (I);} return s;} int main () {int X, Y, N; while (scanf ("% d", & N )! = EOF) {Init (c); Init (lev); For (INT I = 0; I <n; I ++) {scanf ("% d ", & X, & Y); int temp = sum (x + 1); lev_[ temp] ++; add (x + 1, 1) ;}for (INT I = 0; I <n; I ++) printf ("% d \ n", lev[ I]);} return 0 ;}


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.