Pagini recente » Cod sursa (job #3275845) | Cod sursa (job #2303684) | Cod sursa (job #1922668) | Cod sursa (job #2488498) | Cod sursa (job #2754040)
#include <iostream>
#include <fstream>
using namespace std;
int v[30001], n, k = 1, w[300001];
int main() {
ifstream fin ("schi.in");
ofstream fout ("schi.out");
fin>>n>>v[1];
for (int i = 2; i <= n; ++i) {
fin>>v[i];
k++;
for (int j = i - 1; j >= 1; j--) {
if (v[i] <= v[j])
v[j]++;
}
}
for (int i = 1; i <= n; ++i) {
w[v[i]] = i;
}
for (int i = 1; i <= n; ++i) {
fout<<w[i]<<endl;
}
return 0;
}