Pagini recente » Cod sursa (job #3231450) | Cod sursa (job #2127139) | Cod sursa (job #3306467) | Cod sursa (job #1758714) | Cod sursa (job #3338884)
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream fin("schi.in");
ofstream fout("schi.out");
int N;
fin >> N;
vector<int> intermediar(N + 1);
vector<int> final(N + 1, 0);
for (int i = 1; i <= N; i++) {
fin >> intermediar[i];
}
for (int i = 1; i <= N; i++) {
int k = intermediar[i];
int count = 0;
for (int j = 1; j <= N; j++) {
if (final[j] == 0) count++;
if (count == k) {
final[j] = i;
break;
}
}
}
for (int i = 1; i <= N; i++) {
fout << final[i] << "\n";
}
return 0;
}