Pagini recente » Cod sursa (job #1662771) | Cod sursa (job #882689) | Cod sursa (job #3236064) | Cod sursa (job #1798093) | Cod sursa (job #2477617)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int n,cnt,v[100005],dp[100005],lg[100005],sol[100005];
int main(void)
{ f>>n;
for(int i=1;i<=n;++i) f>>v[i];
for(int i=1;i<=n;++i)
{ if(v[i]>dp[cnt]) {dp[++cnt]=v[i]; lg[i]=cnt;}
else
{ int st=1,dr=cnt,x=cnt;
while(st<=dr)
{ int m=(st+dr)/2;
if(dp[m]<v[i]) st=m+1; else {dr=m-1; x=m;}
}
dp[x]=v[i]; lg[i]=x;
}
}
g<<cnt<<'\n';
int m=0;
for(int i=n;i && cnt;--i)
if(lg[i]==cnt) {sol[++m]=v[i]; --cnt;}
for(int i=m;i;--i) g<<sol[i]<<' ';
g.close(); return 0;
}