Pagini recente » Cod sursa (job #2489571) | Cod sursa (job #1291863) | Cod sursa (job #925550) | Cod sursa (job #1120737) | Cod sursa (job #1363611)
#include <iostream>
#include <fstream>
using namespace std;
int N, L, v[100001], longmax[100001], last[100001];
ifstream f("scmax.in");
ofstream g("scmax.out");
void afisaresubmax(int n){
if(longmax[n])
afisaresubmax(longmax[n]);
g<<v[n]<<' ';
}
int main()
{
f>>N;
for(int i=1;i<=N;++i)
f>>v[i];
last[1]=1;
L=1;
for(int i=2;i<=N;++i){
int st=1,dr=L,m;
while(st <= dr){
m=(dr+st)/2;
if(v[last[m]]<v[i])
st=m+1;
else
dr=m-1;
}
if(st-L==1)
++L;
last[st]=i;
// longmax[i]=last[st-1];
longmax[i]=last[st-1];
}
g<<L<<'\n';
afisaresubmax(last[L]);
return 0;
}