POJ2182 Lost Cows

树状数组+二分

将数组初始化为1，二分查找前缀和，前缀和代表有多少个数比当前位置小

#include<cstdio>
using namespace std;
const int maxn = 8e3 + 5;
int a[maxn], b[maxn], n, ans[maxn];
int lowbit(int x){return x&(-x);}
void update(int k,int x)
{
    for(int i = k; i <= n; i+=lowbit(i)){
        b[i] += x;
    }
}
int getsum(int x)
{
    int ans = 0;
    for(int i = x; i; i-=lowbit(i)){
        ans += b[i];
    }
    return ans;
}
int main()
{
    scanf("%d",&n);
    for(int i = 2; i <= n; i++){
        scanf("%d",&a[i]);
    }
    for(int i = 1; i <= n; i++) update(i,1);
    int l, r, mid;
    for(int i = n; i > 0; i--){
        l = 1; r = n;
        while(l < r){
            mid = (l+r)/2;
            if(getsum(mid) > a[i]){
                r = mid;
            }
            else l = mid+1;
        }
        update(l,-1);
        ans[i] = l;
    }
    for(int i = 1; i <= n; i++){
        printf("%d\n",ans[i]);
    }
    return 0;
}