Pagini recente » Cod sursa (job #2272990) | Cod sursa (job #1136079) | Cod sursa (job #1300503) | Cod sursa (job #1406592) | Cod sursa (job #3303605)
#include <bits/stdc++.h>
#define lsb(x) (x&(-x))
#define NMAX 30002
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
struct AIB{
vector <int> aib;
AIB (int N){
aib.resize(N+1);
}
void update(int pos,int val){
for(int i=pos;i<(int)aib.size();i+=lsb(i)){
aib[i]+=val;
}
}
int query(int pos){
int ret=0;
for(int i=pos;i>0;i-=lsb(i)){
ret+=aib[i];
}
return ret;
}
int find(int val){
int ans=0;
int sum_ans=0;
for(int pas=(1<<18);pas>0;pas>>=1){
if(ans+pas>=(int)aib.size()) {continue;}
if(sum_ans+aib[ans+pas]<val){
ans+=pas;
sum_ans+=aib[ans];
}
}
return ans;
}
};
int N;
int arr[NMAX];
int ans[NMAX];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
fin >> N;
cout << N;
AIB aib(N+2);
for(int i=1;i<=N;i++){
fin >> arr[i];
aib.update(i,1);
}
for(int i=N;i>=1;i--){
int place=aib.find(arr[i])+1;
ans[place]=i;
// cout << place << " , " << i << "\n";
aib.update(place,-1);
}
for(int i=1;i<=N;i++){
fout << ans[i] << "\n";
}
return 0;
}