zoukankan      html  css  js  c++  java
  • hdu 1541 Stars

    A - Stars
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

    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
    最基础的树状数组
     1 #include<iostream>
     2 #include<string>
     3 #include<cstdio>
     4 #include<vector>
     5 #include<queue>
     6 #include<stack>
     7 #include<algorithm>
     8 #include<cstring>
     9 #include<stdlib.h>
    10 #include<string>
    11 #include<cmath>
    12 using namespace std;
    13 #define pb push_back
    14 int n,p[32100],num[32100];
    15 void update(int pos){
    16     while(pos<=32001){
    17         p[pos]+=1;
    18         pos+=pos&(-pos);
    19     }
    20 }
    21 int getnum(int pos){
    22     int sum=0;
    23     while(pos>=1){
    24         sum+=p[pos];
    25         pos-=pos&(-pos);
    26     }
    27     return sum;
    28 }
    29 int main(){
    30     while(cin>>n){
    31         memset(p,0,sizeof(p));
    32         memset(num,0,sizeof(num));
    33         for(int i=1;i<=n;i++){
    34             int x,y;scanf("%d%d",&x,&y);
    35             x++;
    36             num[getnum(x)]++;
    37             update(x);
    38         }
    39         for(int i=0;i<n;i++)
    40             cout<<num[i]<<endl;
    41     }
    42 }
  • 相关阅读:
    Manjaro配置攻略
    Manjaro蓝牙连接问题
    清除所有分区的根目录下的存在隐藏对系统不利的代码的文件
    取消默认磁盘共享
    高手必读 网络端口安全防护技巧放送
    批处理设置虚拟内存
    批处理方式修改IP地址和电脑名
    c++的基本知识
    Windows线程同步与互斥技术总结
    批处理方式设置XP系统的服务程序
  • 原文地址:https://www.cnblogs.com/ainixu1314/p/3888672.html
Copyright © 2011-2022 走看看