Pagini recente » Cod sursa (job #748281) | Borderou de evaluare (job #129439) | Cod sursa (job #3271201) | Monitorul de evaluare | Cod sursa (job #2118953)
#include <fstream>
#define MAXN 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int N, dp[MAXN], v[MAXN], nn, dad[MAXN];
inline int BinarySearch(int val) {
int ii, step;
for (step = 1; step <= nn; step <<= 1);
for (ii = 0; step; step >>= 1) {
if (ii + step <= nn && v[dp[ii + step]] < val)
ii += step;
}
return ii;
}
inline void Afis(int a) {
if (a) {
Afis(dad[a]);
fout << v[a] << " ";
}
}
inline void Read() {
fin >> N;
int poz;
for (int i = 1; i <= N; i++) {
fin >> v[i];
poz = BinarySearch(v[i]);
nn = max(nn, poz + 1);
dad[i] = dp[poz];
dp[poz + 1] = i;
}
fout << nn << "\n";
Afis(dp[nn]);
}
int main () {
Read();
fin.close(); fout.close(); return 0;
}