树状数组简单poj 2481

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<sstream>
#include<string>
#include<climits>
#include<stack>
#include<set>
#include<bitset>
#include<cmath>
#include<deque>
#include<map>
#include<queue>
#define iinf 2000000000
#define linf 1000000000000000000LL
#define dinf 1e200
#define eps 1e-5
#define all(v) (v).begin(),(v).end()
#define sz(x)  x.size()
#define pb push_back
#define mp make_pair
#define lng long long
#define sqr(a) ((a)*(a))
#define pii pair<int,int>
#define pll pair<lng,lng>
#define pss pair<string,string>
#define pdd pair<double,double>
#define X first
#define Y second
#define pi 3.14159265359
#define ff(i,xi,n) for(int i=xi;i<=(int)(n);++i)
#define ffd(i,xi,n) for(int i=xi;i>=(int)(n);--i)
#define ffl(i,r) for(int i=head[r];i!=-1;i=edge[i].next)
#define cc(i,j) memset(i,j,sizeof(i))
#define two(x)			((lng)1<<(x))
#define N 100010
#define M 1000000
#define lson l , mid , rt << 1
#define rson mid + 1 , r , rt << 1 | 1
#define Mod  n
#define Pmod(x) (x%Mod+Mod)%Mod
using namespace std;
typedef vector<int>  vi;
typedef vector<string>  vs;
typedef unsigned int uint;
typedef unsigned lng ulng;
template<class T> inline void checkmax(T &x,T y){if(x<y) x=y;}
template<class T> inline void checkmin(T &x,T y){if(x>y) x=y;}
template<class T> inline T Min(T x,T y){return (x>y?y:x);}
template<class T> inline T Max(T x,T y){return (x<y?y:x);}
template<class T> T gcd(T a,T  b){return (a%b)==0?b:gcd(b,a%b);}
template<class T> T lcm(T a,T b){return a*b/gcd(a,b);}
template<class T> T Abs(T a){return a>0?a:(-a);}
template<class T> inline T lowbit(T n){return (n^(n-1))&n;}
template<class T> inline int countbit(T n){return (n==0)?0:(1+countbit(n&(n-1)));}
int n,sum[100010],ans
;
struct  pp
{
int l,r,id;
pp(int lx=0,int rx=0,int idx=0):l(lx),r(rx),id(idx){};
}a
;
bool cmp(pp p, pp q)
{
return p.r>q.r||(p.r==q.r&&p.l<q.l);
}
void update(int x)
{
while(x<=100001)
{
sum[x]++;
x+=lowbit(x);
}
}
int get(int  x)
{
int val=0;
while(x)
{
val+=sum[x];
x-=lowbit(x);
}
return val;
}
int main()
{
while(scanf("%d",&n),n)
{
ff(i,1,n)
{
int l,r;
scanf("%d%d",&l,&r);
a[i]=pp(l+1,r+1,i);
}
sort(a+1,a+1+n,cmp);
cc(sum,0);
update(a[1].l);
ans[a[1].id]=0;
ff(i,2,n)
{
if(a[i].l==a[i-1].l&&a[i].r==a[i-1].r) ans[a[i].id]=ans[a[i-1].id];
else
{
ans[a[i].id]=get(a[i].l);
}  update(a[i].l);
}
printf("%d",ans[1]);
ff(i,2,n)
printf(" %d",ans[i]);
puts("");
}
return 0;
}