本文共 1480 字，大约阅读时间需要 4 分钟。

?n????????????1?n?????????????????????????????????

????

?????????????????????????????????????Fenwick Tree??????????????????????????

???????

????

#include 
   
    #include 
    
     #include 
     
      using namespace std;int lowbit(int x) {    return x & -x;}void add(int x, int c, int n, vector
      
       & tr) {    while (x <= n) {        tr[x] += c;        x += lowbit(x);    }}int sum(int x, int n, const vector
       
        & tr) {    int res = 0;    while (x > 0) {        res += tr[x];        x -= lowbit(x);    }    return res;}int main() {    int n;    vector
        
          a(n + 1); for (int i = 2; i <= n; ++i) { a[i] = 0; } for (int i = 1; i <= n; ++i) { int val; scanf("%d", &val); a[i] = val; } vector
         
           tr(n + 1, 1); // ???????????????1 vector
          
            ans(n + 1); for (int i = n; i >= 1; --i) { int k = a[i] + 1; int l = 1, r = n; while (l < r) { int mid = (l + r + 1) / 2; int s = sum(mid, n, tr); if (s >= k) { r = mid; } else { l = mid; } } ans[i] = l; add(l, -1, n, tr); } for (int i = 1; i <= n; ++i) { printf("%d\n", ans[i]); } return 0;}
          
         
        
       
      
     
    
   

????

?????????????????????????????????

转载地址：http://satn.baihongyu.com/