Cod sursa(job #3247356)
| Utilizator | Data | 7 octombrie 2024 12:10:50 | |
|---|---|---|---|
| Problema | Schi | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 3e4;
int v[MAX_N];
int n;
void insert (int pos, int val) {
int i;
for (i = n - 1; i >= pos; i--) {
v[i + 1] = v[i];
}
v[pos] = val;
}
int main() {
ifstream cin("schi.in");
ofstream cout("schi.out");
int i, val;
cin >> n;
for (i = 0; i < n; i++) {
cin >> val;
insert(val - 1, i + 1);
}
for (i = 0; i < n; i++) {
cout << v[i] << "\n";
}
return 0;
}