Cod sursa(job #3338859)
| Utilizator | Data | 5 februarie 2026 12:06:25 | |
|---|---|---|---|
| Problema | Schi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int main() {
int N;
fin >> N;
int poz[30001];
for (int i = 1; i <= N; i++)
fin >> poz[i];
int sol[30001];
int len = 0;
for (int i = N; i >= 1; i--) {
int p = poz[i];
for (int j = len; j >= p; j--)
sol[j + 1] = sol[j];
sol[p] = i;
len++;
}
for (int i = 1; i <= N; i++)
fout << sol[i] << "\n";
return 0;
}
