Cod sursa(job #3303664)
| Utilizator | Data | 17 iulie 2025 09:06:08 | |
|---|---|---|---|
| Problema | Schi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
int n,cf[30005],l[30005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
int loc=0;
f>>loc;
if(l[loc])
{
for(int j=n;j>loc;j--)
{
l[j]=l[j-1];
}
}
l[loc]=i;
}
for(int i=1;i<=n;i++)
g<<l[i]<<'\n';
return 0;
}
