zoukankan      html  css  js  c++  java
  • POJ 2352Stars 树状数组

    Stars
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 42898   Accepted: 18664

    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.

    Source

     
    题意:如果一个点的左下方(包含正左和正下)有k个点,就说这个点是k级的。求出各个级别的点的个数。、
    思路:将点按y升序,y相同按x升序进行排序。按照x轴建立一位树状数组。(或者将点按x升序,x相同按y升序进行排序。按照y轴建立一位树状数组)

    代码:

    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    const int MAXN=15100,MAXX=32100;
    int c[MAXX];
    int ans[MAXN];
    int lowbit(int x)
    {
        return x&(-x);
    }
    void add(int i,int val)
    {
        for(i; i<=MAXX; i+=lowbit(i))
            c[i]+=val;
    }
    int sum(int i)
    {
        int s=0;
        for(i; i>0; i-=lowbit(i))
            s+=c[i];
        return s;
    }
    int main()
    {
        int i,n;
        int x,y;
        while(scanf("%d",&n)!=EOF)
        {
            memset(c,0,sizeof(c));
            memset(ans,0,sizeof(ans));
            for(i=0; i<n; i++)
            {
                scanf("%d%d",&x,&y);
                int temp=sum(x+1);
                ans[temp]++;
                add(x+1,1);
            }
            for(i=0; i<n; i++)
                printf("%d
    ",ans[i]);
        }
        return 0;
    }
    树状数组
    I am a slow walker,but I never walk backwards.
  • 相关阅读:
    点击按钮显示隐藏层 和 切换按钮同时显示多个隐藏层
    CSS3混合模式background-blend-mode
    阿里云服务器出现Warning: Cannot modify header information
    谷歌浏览器,添加默认搜索引擎的搜索地址
    常用的php数组函数
    array_map,array_filter,array_walk区别
    当一个按钮点击不了时,鼠标可以自定义的样式
    滚动到页面底部触发分页事件
    表单提交,不合法表单元素标签的高亮、页面上滚到某一个元素的位置
    表单提示输入,边框颜色渐变
  • 原文地址:https://www.cnblogs.com/GeekZRF/p/5914470.html
Copyright © 2011-2022 走看看