Lost Cows POJ - 2182(树状数组)

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

题意有n个不同的数，大小范围是1到n，且两两不同。给你n-1个信息从2到n，表示前面有多少个数，比它小，请你构造这个数列。

思路很显然，如果从后往前看，前面位置的关系，最后一个数是没有影响的，所以一开始我们可以把最后一个数确定下来。这样一直递归的去找，朴素的做法的复杂度是$O(n^2)$，但是如何高效去记录有多少个数被占用的前提下，比当前数小的个数，我们就可以用树状数组来记录。
那么显然是有单调性的。所以就用二分去找了。复杂度$O(nlog^2n)$

代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#define maxx 100005
using namespace std;
int n,q;
int a[maxx];
int c[maxx];
void change(int x,int p)
{
    for(;x<=n;x+=x&-x)c[x]+=p;
}
int ask(int x)
{
    int ans=0;
    for(;x;x-=x&-x)ans+=c[x];
    return ans;
}
int getIndex(int x)
{
    int l=1,r=n;
    while(l<=r)
    {
        int mid=(l+r)>>1;
        if(ask(mid)>=x)
            r=mid-1;
        else
            l=mid+1;
    }
    return l;
}
int ans[maxx];
int vis[maxx];
int main()
{
    cin>>n;
    for(int i=2;i<=n;i++)
        scanf("%d",a+i);
    for(int i=1;i<=n;i++)
        change(i,1);
    for(int i=n;i>=2;i--)
    {
        ans[i]=getIndex(a[i]+1);
        vis[ans[i]]=true;
        change(ans[i],-1);
    }
    for(int i=1;i<=n;i++)
        if(!vis[i])
    {
        cout<<i<<endl;
        break;
    }
    for(int i=2;i<=n;i++)
        printf("%d\n",ans[i]);
    return 0;
}