Pagini recente » Cod sursa (job #1817723) | Borderou de evaluare (job #3268889) | Cod sursa (job #1669903) | Cod sursa (job #2761169) | Cod sursa (job #3276347)
#include <fstream>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,v[nmax],dp[nmax],k,t[nmax];
void rec(int n){
if(t[n]!=0)
rec(t[n]);
cout<<v[n]<<" ";
}
signed main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
int st=1,dr=k,p=0;
while(st<=dr){
int mid=(st+dr)/2;
if(v[dp[mid]]>=v[i])
p=mid,dr=mid-1;
else
st=mid+1;
}
if(p==0){
t[i]=dp[k];
dp[++k]=i;
}else{
t[i]=dp[k-1];
dp[k]=i;
}
}
cout<<k<<'\n';
rec(dp[k]);
return 0;
}