Pagini recente » Cod sursa (job #1812373) | Cod sursa (job #1015224) | Cod sursa (job #2820607) | Cod sursa (job #652505) | Cod sursa (job #2635668)
#include<bits/stdc++.h>
#define maxn 100050
using namespace std;
int a[maxn],q[maxn],p[maxn],n,len;
int solve(int x,int st,int dr){
int md=(st+dr)/2;
if(st==dr){
if(dr>len) ++len;
q[st]=x;
return st;
}else if(x<=q[md]) solve(x,st,md);
else solve(x, md+1, dr);
}
void print(int x, int y){
if(x){
if(p[y]==x)
print(x-1,y-1), cout<<a[y]<<' ';
else print(x,y-1);
}else cout<<len<<'\n';
}
int main(){
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=1; i<=n; i++)
p[i]=solve(a[i],1,len+1);
print(len,n);
}