Pagini recente » Cod sursa (job #529921) | Cod sursa (job #1206102) | Cod sursa (job #13838) | Cod sursa (job #2176438) | Cod sursa (job #2230691)
#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];
//n = generator();
vector<int> sol(n + 1, 0);
for(int i = n; i >= 1; i --) {
int nr = 0;
for(int j = n; j > i; j --)
if(v[j] <= v[i])
nr ++;
int pos = v[i] + nr;
while(pos <= n && check[pos] == 1)
pos ++;
check[pos] = 1;
sol[pos] = i;
}
for(int i = 1; i <= n; i ++)
out << sol[i] << "\n";
//brute(sol, n);
return 0;
}