首页 / 更多教程 / poj2352树状数组

poj2352树状数组

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了poj2352树状数组，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含2631字，纯文字阅读大概需要4分钟。

内容图文

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.
题意：给你一串坐标，找左下方的星星数
题解：树状数组，x方向处理，因为是从y方向递增的
技术分享 技术分享 
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define ll long long
#define mod 1000000007

usingnamespace std;

constdouble g=10.0,eps=1e-9;
constint N=15000+5,maxn=32000+5,inf=0x3f3f3f3f;

int s[maxn],num[maxn];

void add(int i,int x)
{
    while(i<=maxn){
        s[i]+=x;
        i+=i&(-i);
    }
}
int sum(int i)
{
    int ans=0;
    while(i>0){
        ans+=s[i];
        i-=i&(-i);
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
 //   cout<<setiosflags(ios::fixed)<<setprecision(2);int n,x,y;
    while(cin>>n){
        memset(num,0,sizeof num);
        memset(s,0,sizeof s);
        for(int i=1;i<=n;i++)
        {
            cin>>x>>y;
            int te=sum(x+1);
            num[te]++;
            add(x+1,1);
        }
        for(int i=0;i<n;i++)cout<<num[i]<<endl;
    }
    return0;
}
View Code

 

原文：http://www.cnblogs.com/acjiumeng/p/6758350.html

内容总结

以上是互联网集市为您收集整理的poj2352树状数组全部内容，希望文章能够帮你解决poj2352树状数组所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1328904.html

来源：【匿名】