Pagini recente » Cod sursa (job #1248969) | Cod sursa (job #1891497) | Cod sursa (job #1424461) | Cod sursa (job #1794591) | Cod sursa (job #2230867)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream in("schi.in");
ofstream out("schi.out");
const int NMAX = 30005;
int v[NMAX], n;
bool check[NMAX];
int main() {
in >> n;
for(int i = 1; i <= n; i ++)
in >> v[i];
vector<int> sol(n + 1, 0);
for(int i = n; i >= 1; i --) {
int pos = 1, nr = v[i];
while(pos <= n && nr) {
if(check[pos] == 0)
nr --;
pos ++;
}
pos --;
check[pos] = 1;
sol[pos] = i;
}
for(int i = 1; i <= n; i ++)
out << sol[i] << "\n";
return 0;
}