Pagini recente » Cod sursa (job #3340535) | Cod sursa (job #1291083) | Cod sursa (job #816773) | Cod sursa (job #3310070) | Cod sursa (job #3338876)
#include<bits/stdc++.h>
using namespace std;
long long n, A[3001], i, x, p, j;
int main ()
{ ifstream f("schi.in");
ofstream g("schi.out");
f >> n;
for(i = 1; i <= n; i++)
f >> A[i];
p = 1;
while(p <= n)
{ for(i = 1; i <= n; i++)
if(A[i] == p ) x = i;
for(j = 1; j <= x - 1; j++)
if(A[j] >= p ) A[j]++;
p++; }
int ok = 1;
while(ok <= n)
{ for(i = 1;i <= n; i++)
if(A[i]==ok) g << i <<"\n";
ok++; }
f.close();
g.close();
return 0;}