Pagini recente » Cod sursa (job #2073989) | Monitorul de evaluare | Cod sursa (job #1126892) | Cod sursa (job #1344968) | Cod sursa (job #2066746)
#include <fstream>
#include <cstring>
#define MAXN 30005
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int n, p[MAXN], ait[MAXN * 3], sol[MAXN], fr[MAXN];
inline void Read() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> p[i];
}
inline void Search(int poz, int st, int dr, int a, int val) {
if (ait[poz] <= a && fr[ait[poz]] != val) {
fr[ait[poz]] = val;
a++;
}
if (st == dr && st == a) {
ait[poz] = a;
sol[a] = val;
return;
}
if (st > a || dr < a)
return;
int mij = (st + dr) / 2;
Search(poz * 2, st, mij, a, val);
Search(poz * 2 + 1, mij + 1, dr, a, val);
ait[poz] = min(ait[poz * 2], ait[poz * 2 + 1]);
}
inline void Solve() {
memset(ait, inf, sizeof(ait));
for (int i = n; i; i--) {
Search(1, 1, n, p[i], i);
}
}
inline void Write() {
for (int i = 1; i <= n; i++)
fout << sol[i] << " ";
}
int main () {
Read();
Solve();
Write();
fin.close(); fout.close(); return 0;
}