hdu 1556 树状数组

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

const int MAX_N = 1e5;

int sum[MAX_N+5];
int N;

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

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

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

int main(){
while( scanf( "%d", &N ) && N ){
memset( sum, 0, sizeof( sum ) );
for( int i = 1; i <= N; i++ ){
int temp1, temp2;
scanf( "%d%d", &temp1, &temp2 );
updata( temp1, 1 );
updata( temp2 + 1, -1 );
}
printf( "%d", getsum( 1 ) );
for( int i = 2; i <= N; i++ ){
printf( " %d", getsum( i ) );
}
printf( "\n" );
}
return 0;
}