POJ 2182 Lost Cows

 

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10996		Accepted: 7059

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

Source

USACO 2003 U S Open Orange

 

另开一个数组按编号顺序记录奶牛的状态，像这样： 1 1 1 1 1

算前缀和就能知道一头牛前面的牛数量。

倒着处理数据，若最后一头牛看到前面有0头编号更小的牛，通过上面的数组就可以知道这头牛的编号是1。

记录最后一头牛的编号，然后在数组中删去这头牛，数组变成0 1 1 1 1

以此类推

 

/*by SilverN*/
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int mxn=9000;
int a[mxn];
int c[mxn];
int num[mxn];
int n;
inline int lowbit(int x){
    return x&-x;
}
inline int sum(int x){
    int i=x,res=0;
    while(i){
        res+=c[i];
        i-=lowbit(i);
    }
//    printf("sum[%d]==%d\n",x,res);
    return res;
}
inline int find(int x){
    int l=1,r=n;
    int mid;
    while(l<r){
        mid=((l+r)>>1)+1;
        if(sum(mid)<=x)l=mid;
        else r=mid-1;
    }
    return l;
}
int main(){
    scanf("%d",&n);
    int i,j;
    for(i=1;i<n;i++){
        scanf("%d",&a[i+1]);
    }
    for(i=1;i<=n;i++){//初始化
        int tmp=i;
        while(tmp<=n){
            c[tmp]++;
            tmp+=lowbit(tmp);
        }
    }
    for(i=n;i>=1;i--){
        int tmp=find(a[i]+1);
//        printf("test %d %d\n",a[i],tmp);
        num[i]=tmp++;
        while(tmp<=n){
            c[tmp]--;
            tmp+=lowbit(tmp);
        }
    }
    for(i=1;i<=n;i++)printf("%d\n",num[i]);
    return 0;
}