POJ2352-Stars(树状数组模板)

Stars Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 46056   Accepted: 19877 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 Ural Collegiate Programming Contest 1999

题目大意:就是求每个小星星左小角的星星的个数。坐标按照Y升序，Y相同X升序的顺序给出,由于y轴已经排好序，可以按照x坐标建立一维树状数组

做题思路:这是我第一道树状数组题，树状数组题主要是针对的是求和和单点修改的，主要分为三个函数一个是求和，一个是修改（增加),一个是lowbit，这个是个很玄学的东西，就不再赘述，写这道题就是基本上是个裸的板子，然后再写几个树状数组争取学会，这个裸的板子，以后可以做参考

#include<iostream>  
#include<cstdio>
#include<stdio.h>
#include<cstring>  
#include<cstdio>  
#include<climits>  
#include<cmath> 
#include<vector>
#include <bitset>
#include<algorithm>  
#include <queue>
#include<map>
using namespace std;
int i, n;
int level[32008], c[32008];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x)
{
	while (x<=32008)
	{
		++c[x];
		x += lowbit(x);
	}
}
int search(int x)
{
	int sum = 0;
	while (x>0)
	{
		sum += c[x];
		x -= lowbit(x);
	}
	return sum;
}
int main()
{
	int x, y;
	memset(level, 0, sizeof(level));
	memset(c, 0, sizeof(c));
	//cin >> n;
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
	{
		//cin >> x >> y; 
		scanf("%d %d", &x, &y);
		++x;
		level[search(x)]++;
		add(x);

	}
	for (i = 0; i < n; ++i)
	{
		printf("%d\n", level[i]);
	}
}