Description
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
Output
Sample Input
Sample Output
AC Code
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <queue>
#include <time.h>
#define inf 0x3f3f3f3f
#define maxn 32005
#define MOD 50000
using namespace std;
const double pi=acos(-1.0),ee=2.7182818284590452354;
int c[maxn],ans[maxn];
int lowbit(int i)
{
return i&(-i);
}
int update(int i,int val)
{
while(i<=maxn)
{
c[i]+=val;
i+=lowbit(i);
}
}
int query(int i)
{
int summ=0;
while(i>0)
{
summ+=c[i];
i-=lowbit(i);
}
return summ;
}
int main(int argc, char** argv) {
int n,x,y;
while(cin>>n){
int i;
memset(c,0,sizeof(c));
memset(ans,0,sizeof(ans));
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
x++; //不知道爲什麼不加這句就TLE
ans[query(x)]++;
update(x,1);
}
for(i=0;i<n;i++)
printf("%d\n",ans[i]);
}
return 0;
}