程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> POJ 2352-Stars(線段樹)

POJ 2352-Stars(線段樹)

編輯：C++入門知識

POJ 2352-Stars(線段樹)

Stars Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2352 Appoint description:

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.
題意：求每個點的左下方和左方的點的個數，個數為幾，該點的level就為幾，求從0~n-1這個范圍內每個level的個數。

思路：用線段樹維護一下每一個橫坐標出現的次數。

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include
using namespace std;
typedef long long LL;
const int inf=0x3f3f3f3f;
const double pi= acos(-1.0);
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int MAXN=15000+10;
struct node
{
    int x;
    int y;
}q[MAXN<<2];
int sum[MAXN<<4];
int cnt[MAXN<<4];
int cmp(struct node a,struct node b)
{
    if(a.y!=b.y)
        return a.y>1;
    if(p<=mid)
        Update(p,lson);
    else
        Update(p,rson);
    PushUp(rt);
}

int Query(int ll,int rr,int l,int r,int rt)
{
    if(ll<=l&&rr>=r){
        return sum[rt];
    }
    int mid=(l+r)>>1;
    int ans=0;
    if(ll<=mid)
        ans+=Query(ll,rr,lson);
    if(rr>mid)
        ans+=Query(ll,rr,rson);
    return ans;

}

int main()
{
    int n,i;
    scanf("%d",&n);
    int maxx=-inf;
    memset(sum,0,sizeof(sum));
    for(i=0;i