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.
解題思路:數狀數組可以對區間進行求和,利用這個性質,來求解答案
代碼如下:
#include <cstdio>
#include <cstring>
using namespace std;
#define N 32005
int n,c[N],ans[N],x,y;
int lowbit(int k)
{
return k&-k;
}
int sum(int x)
{
int ret=0;
while(x>0)
{
ret+=c[x];
x-=lowbit(x);
}
return ret;
}
void add(int x,int d)
{
while(x<=N)
{
c[x]+=d;
x+=lowbit(x);
}
}
int main()
{
int i,j,k;
while(~scanf("%d",&n))
{
memset(ans,0,sizeof(ans));
memset(c,0,sizeof(c));
for(i = 1; i<=n; i++)
{
scanf("%d%d",&x,&y);
x++; //x加一的目的是防止x出現0的情況,樹狀數組不能對0進行操作
ans[sum(x)]++; //sum[] 表示的當前的和(x點前面的個數),ans[],表示在這種和的情況的個數
add(x,1); //進行相加操作
}
for(i = 0; i<n; i++)
printf("%d\n",ans[i]);
}
return 0;
}