poj 2182 Lost Cows

Lost Cows

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9201		Accepted: 5917

Description

N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for their evening meal, they did not line up in the required ascending numerical order of their brands. 

Regrettably, FJ does not have a way to sort them. Furthermore, he's not very good at observing problems. Instead of writing down each cow's brand, he determined a rather silly statistic: For each cow in line, he knows the number of cows that precede that cow in line that do, in fact, have smaller brands than that cow. 

Given this data, tell FJ the exact ordering of the cows. 

Input

* Line 1: A single integer, N 

* Lines 2..N: These N-1 lines describe the number of cows that precede a given cow in line and have brands smaller than that cow. Of course, no cows precede the first cow in line, so she is not listed. Line 2 of the input describes the number of preceding cows whose brands are smaller than the cow in slot #2; line 3 describes the number of preceding cows whose brands are smaller than the cow in slot #3; and so on. 

Output

* Lines 1..N: Each of the N lines of output tells the brand of a cow in line. Line #1 of the output tells the brand of the first cow in line; line 2 tells the brand of the second cow; and so on.

Sample Input

5
1
2
1
0

Sample Output

2
4
5
3
1

题解及思路：

       从后向前扫描，每个逆序值代表所求的当前位的数在剩余的数里面的所处的位置，这样用线段树来找其位置就可以了。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <string>
#define maxn 8080
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ALL %I64d
using namespace std;
typedef long long  ll;

struct segment
{
    int l,r;
    int value;
} son[maxn<<2];

void PushUp(int rt)
{
    son[rt].value=son[rt<<1].value+son[rt<<1|1].value;
}

void Build(int l,int r,int rt)
{
    son[rt].l=l;
    son[rt].r=r;
    if(l==r)
    {
        son[rt].value=1;
        return;
    }
    int m=(l+r)/2;
    Build(lson);
    Build(rson);
    PushUp(rt);
}


int Update(int w,int rt)
{
    if(son[rt].l==son[rt].r)
    {
        son[rt].value=0;
        return son[rt].l;
    }

    int m=(son[rt].l+son[rt].r)/2,ret=0;

    if(son[rt<<1].value>w)
       ret=Update(w,rt<<1);
    else
    {
        w-=son[rt<<1].value;
        ret=Update(w,rt<<1|1);
    }
    PushUp(rt);
    return ret;
}

int main()
{
    int n;
    int t[8080];
    while(scanf("%d",&n)!=EOF)
    {
        Build(1,n,1);
        t[0]=0;
       for(int i=1;i<n;i++)
       {
           scanf("%d",&t[i]);
       }
       for(int i=n-1;i>=0;i--)
       {
           t[i]=Update(t[i],1);
       }
       for(int i=0;i<n;i++)
       {
           printf("%d\n",t[i]);
       }
    }
    return 0;
}