Pagini recente » Cod sursa (job #2681165) | Cod sursa (job #2208962) | Cod sursa (job #1779877) | Cod sursa (job #2167558) | Cod sursa (job #2375226)
#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);
if (n > 4500)
return 0;
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;
}