poj 2182 线段树水 或者树状数组+二分

线段树代码

#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 8888#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)%Modusing 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)));}template<class T> inline bool isPrimeNumber(T n){if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}int n,sum[N<<2],id[N],a[N];void pushup(int rt){    sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void build(int l,int r,int  rt){    if(l==r)    {        sum[rt]=1;        return ;    }    int  mid=(l+r)/2;    build(lson);    build(rson);    pushup(rt);}void update(int p,int add,int l,int r,int rt){    if(l==r)    {        sum[rt]+=add;        return;    }    int mid=(l+r)>>1;    if(p<=mid) update(p,add,lson);    else  update(p,add,rson);    pushup(rt);}int query(int x,int l,int r,int rt){    if(l==r)    {        return l;    }    int mid=(l+r)>>1;    if(x>sum[rt<<1])    return query(x-sum[rt<<1],rson);    else    return query(x,lson);}int main(){ while(scanf("%d",&n)==1) {    build(1,n,1);    ff(i,2,n)    scanf("%d",a+i);    ffd(i,n,2)    {        int k=a[i];         id[i]=query(k+1,1,n,1);         update(id[i],-1,1,n,1);    }    id[1]=query(1,1,n,1);    ff(i,1,n)    printf("%d\n",id[i]); }    return 0;}

树状数组+二分

#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 8888#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)%Modusing 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)));}template<class T> inline bool isPrimeNumber(T n){if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}int n,sum[N],id[N],a[N];void  update(int x,int add){    while(x<=n)    {        sum[x]+=add;        x+=lowbit(x);    }}int get(int x){  int val=0;  while(x)  {      val+=sum[x];      x-=lowbit(x);  }  return val;}int find(int k){    int l=1,r=n;    while(l<=r)    {        int mid=(l+r)>>1;         int x=get(mid);         if(x<k)  l=mid+1;         else          r=mid-1;    }    return l;}int main(){ while(scanf("%d",&n)==1) {     cc(sum,0);    ff(i,2,n)    scanf("%d",a+i);    ff(i,1,n)    update(i,1);    ffd(i,n,2)    {        int k=a[i]+1;        id[i]=find(k);        update(id[i],-1);    }    id[1]=find(1);    ff(i,1,n)    printf("%d\n",id[i]); }    return 0;}