Cod sursa(job #2375136)
| Utilizator | Data | 7 martie 2019 22:33:01 | |
|---|---|---|---|
| Problema | Schi | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("schi.in");
ofstream out("schi.out");
int main()
{
int n;
in.sync_with_stdio(false);
in >> n;
vector<int> v(n + 1);
vector<int> loc(n + 1);
vector<int> sol(n + 1);
for (int i = 1; i <= n; i++)
{
in >> v[i];
loc[i] = v[i];
for (int j = i - 1; j >= 1; j--)
if (loc[i] <= loc[j])
loc[j]++;
}
for (int i = 1; i <= n; i++)
sol[loc[i]] = i;
for (int i = 1; i <= n; i++)
out << sol[i] << '\n';
return 0;
}
