Pagini recente » Cod sursa (job #29898) | Cod sursa (job #1284806) | Cod sursa (job #2200087) | Cod sursa (job #2786695) | Cod sursa (job #42503)
Cod sursa(job #42503)
#include<fstream.h>
long long n,a[3000],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=n;i>=1;i--)
if(a[i]==p){ x=i;
break;
}
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;
}