Pagini recente » Cod sursa (job #1844615) | Cod sursa (job #821384) | Cod sursa (job #2188906) | Cod sursa (job #2757974) | Cod sursa (job #2036615)
#include <fstream>
#define MAXN 100002
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int dp[MAXN], st, dr, mij, N, v[MAXN], nn, poz, dad[MAXN];
inline int Search(int val) {
int step, ii;
for (step = 1; step < nn; step <<= 1);
for (ii = 0; step; step >>= 1) {
if (step + ii <= nn && v[dp[step + ii]] < val)
ii += step;
}
return ii;
}
inline void Afis(int val) {
if (val) {
Afis(dad[val]);
fout << v[val] << " ";
}
}
inline void Read() {
fin >> N; dad[0] = 0; dp[poz] = 0;
for (int i = 1; i <= N; i++) {
fin >> v[i];
poz = Search(v[i]);
nn = max(nn, poz + 1);
dp[poz + 1] = i;
dad[i] = dp[poz];
}
fout << nn << "\n";
Afis(dp[nn]);
}
int main () {
Read();
fin.close(); fout.close(); return 0;
}