Pagini recente » Cod sursa (job #2667677) | Cod sursa (job #1979978) | Cod sursa (job #1894719) | Cod sursa (job #117062) | Cod sursa (job #44083)
Cod sursa(job #44083)
#include<fstream>
using namespace std;
int n;
int a[30000];
int b[30000];
int main()
{
ifstream fin("schi.in");
ofstream fout("schi.out");
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> a[i];
if (b[a[i]] == 0)
b[a[i]] = i;
else
{
int nr = b[a[i]];
while (b[nr])
{
nr++;
}
for (int j = nr; j > a[i]; j--)
b[j] = b[j-1];
b[a[i]] = i;
}
}
for (int i = 1; i <= n; i++)
fout << b[i] << "\n";
fin.close();
fout.close();
return 0;
}