Pagini recente » Cod sursa (job #2975745) | Cod sursa (job #1204525) | Cod sursa (job #2057790) | Cod sursa (job #2776828) | Cod sursa (job #2036566)
#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;
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 Read() {
fin >> N;
for (int i = 1; i <= N; i++) {
fin >> v[i];
poz = Search(v[i]);
nn = max(nn, poz + 1);
dp[poz + 1] = i;
}
fout << nn << "\n";
for (int i = 1; i <= nn; i++)
fout << v[dp[i]] << " ";
}
int main () {
Read();
fin.close(); fout.close(); return 0;
}