8.6树状数组 Stars

  主要用于：

1.单点修改 ， 区间求和 。

2.区间修改， 单点查询 。

3.区间修改 ， 区间查询。

功能：线段树 > 树状数组

编程效率：树状数组 > 线段树

主要分为两个功能：更新和查询

更新：每次加了个二进制的低位1(101+1 ->110, 110 + 10 -> 1000, 1000 + 1000 -> 10000)

查询：每次就是去掉了二进制中的低位1(1111 - 1 -> 1110, 1110 - 10 -> 1100, 1100 - 100 -> 1000)

lowbit操作：

以二进制数11010为例:11010的补码为00101,加1后为00110,两者相与便是最低位的1

其实很好理解,补码和原码必然相反,所以原码有0的部位补码全是1,补码再+1之后由于进位那么最末尾的1和原码最右边的1一定是同一个位置。

单点修改：

void update(int x,int n,int v)//数组从x到n，加值v
{
    while(x<=n)
    {
        c[x]+=v;
        x+=lowbit(x);
    }
}

 单点查询：

int getsum(int x)
{
    int ans=0;    
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans; 
}

---

区间修改：

在数组的某一段区间，每个值都加上k。

构建差分数组b[i]，差值update（i , b[i] ）。这样统一在c数组上操作。

void update (int x,int n,int k)
{
    while(x<=n)
    {
            c[x]+=k;
            x+=lowbit(x);
    }
}
update(L,k);
update(R+1,-k);

单点查询：

long long getsum(int x)
{
    long long ans=0;    
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans; 
}

其实与第一部分的单点查询没有区别？？

---

  

还有一部分高级操作，没看完.... 

————————————————
版权声明：本文为CSDN博主「bestsort」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/bestsort/article/details/80796531

A.Stars

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

Inputcopy	Outputcopy
5 1 1 5 1 7 1 3 3 5 5	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.

分析：看题意就是标准的树状数组思路

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

const int N=32e3+3;
int c[N],v[N];
int n,x,y;

int lowbit(int x)
{
	return x&(-x);
}

void update(int x,int val)
{
	while(x<=N)
	{
		c[x]+=val;
		x+=lowbit(x);
	}
}

int getsum(int x)
{
	int ans=0;
	while(x>0)
	{
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d%d",&x,&y);
		x++;//笛卡尔坐标系
		update(x,1);//大树枝里的小树枝仅由横坐标x确定
		v[getsum(x)]++;//输入要求星星的分布先由下到上，再由左到右，避免先update大树枝，再update小树枝
					   //使大树枝数据错误 
	}
	for(int i=1;i<=n;i++)
	printf("%d\n",v[i]);//0级v[]数组中存的是1 
	return 0;
}