题目链接:https://codeforces.com/contest/1208/problem/D
思路:倒着到处理给出的序列s[i],对于每个s[i],假设当前位置填的数是t + 1,那么在它前面有1----t 比它小,且1----t == s[i] ,所以模拟这个过程即可:对每个位置i,算出最小的t个数的和等于s[i] ,i位置应该填的数就是t + 1,可以用树状数组模拟这个过程。
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
typedef long long ll;
ll a[maxn] , b[maxn];
ll ans[maxn];
int n;
ll lowbit(ll x) {
return x & -x;
}
void add(ll x ,ll d) {
while(x <= n) {
a[x] += d;
x += lowbit(x);
}
}
ll query(int x) {
ll sum = 0;
while(x > 0) {
sum += a[x];
x -= lowbit(x);
}
return sum;
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
for(int i = 1 ; i <= n ; i++) {
cin >> b[i];
add(i , i);
}
for(int i = n ; i >= 1 ; i-- ) {
ll t = 0 , sum = 0;
for(int j = 21 ; j >= 0 ; j--) {
if((t + (1 << j) < n )&& sum + a[t + (1 << j)] <= b[i]) {
t += (1 << j);
sum += a[t];
}
}
ans[i] = t + 1;
t = t + 1;
add(t,-t);
}
for(int i = 1 ; i <= n ; i++) {
if(i > 1)cout << " ";
cout << ans[i];
}
cout << "\n";
return 0;
}