Pagini recente » Cod sursa (job #1680318) | Cod sursa (job #199427) | Cod sursa (job #825880) | Cod sursa (job #232268) | Cod sursa (job #1896587)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int NMax = 100000 + 5;
int N;
int v[NMax],sol[NMax],previous[NMax];
void display(int);
int main() {
in>>N;
for (int i=1;i<=N;++i) {
in>>v[i];
}
sol[1]=1;
int len = 1;
for (int i=2;i<=N;++i) {
int st = 0,pw = 1;
while (pw<=len) {pw<<=1;}
pw>>=1;
while (pw) {
if (st+pw <= len && v[sol[st+pw]] < v[i]) {
st += pw;
}
pw>>=1;
}
++st;
if (st > len) {
len = st;
}
sol[st] = i;
previous[i] = sol[st-1];
}
out<<len<<'\n';
display(sol[len]);
in.close();out.close();
return 0;
}
void display(int x) {
if (x!=0) {
display(previous[x]);
out<<v[x]<<' ';
}
}