zoukankan      html  css  js  c++  java
  • POJ——T2352 Stars

    http://poj.org/problem?id=2352

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 46592   Accepted: 20096

    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

     
     
    树状数组的应用
    可以先把星星按照从左到右,从下到上排序
    然后把每个星星的级别存到树状数组中就可以了
     1 #include <algorithm>
     2 #include <cstdio>
     3 
     4 #define lowbit(x) (x&(-x))
     5 
     6 using namespace std;
     7 
     8 const int N(15015);
     9 const int N_(32015);
    10 int n;
    11 struct TypeNodeStar
    12 {
    13     int x,y;
    14 }star[N];
    15 
    16 bool cmp(TypeNodeStar a,TypeNodeStar b)
    17 {
    18     if(a.x!=b.x) return a.x<b.x;
    19     return a.y<b.y;
    20 }
    21 
    22 int c[N_];
    23 int ans[N],t[N_];
    24 
    25 int query(int x)
    26 {
    27     int ans=0;
    28     for(;x;x-=lowbit(x)) ans+=t[x];
    29     return ans;
    30 }
    31 
    32 void insert(int x)
    33 {
    34     for(;x<=N_;x+=lowbit(x)) t[x]++;
    35 }
    36 
    37 int main()
    38 {
    39     scanf("%d",&n);
    40     for(int i=1;i<=n;i++)
    41     {
    42         scanf("%d%d",&star[i].x,&star[i].y);
    43         star[i].x++; star[i].y++;
    44     }
    45     sort(star+1,star+n+1,cmp);
    46     for(int i=1;i<=n;i++)
    47     {
    48         int tmp=query(star[i].y);
    49         insert(star[i].y);
    50         ans[tmp]++;
    51     }
    52     for(int i=0;i<n;i++) printf("%d
    ",ans[i]);
    53     return 0;
    54 }
    ——每当你想要放弃的时候,就想想是为了什么才一路坚持到现在。
  • 相关阅读:
    WinAPI: GetClassName
    Delphi 常用API 函数
    DELPHI加密字串(异或运算加密)
    delphi中获得进程列表或想要的进程(枚举进程、遍历进程)
    如何把窗体关闭到系统托盘
    让窗体接受拖放, 并获取拖过来的文件信息
    如何获取图片中第一个像素的颜色值?
    android 使用get和post将数据提交到服务器
    android 简单的读写联系人
    android ContentObserver内容观察者基本使用
  • 原文地址:https://www.cnblogs.com/Shy-key/p/6797605.html
Copyright © 2011-2022 走看看