Pagini recente » Cod sursa (job #98614) | Cod sursa (job #1463256) | Cod sursa (job #2544834) | Cod sursa (job #2812565) | Cod sursa (job #1223243)
# include <cstdio>
# include <algorithm>
# include <cassert>
# include <cstring>
# define infi (1LL<<31-1)
using namespace std;
const int nmax=1000005;
int S[nmax],V[nmax],s[nmax],v[nmax];
int main(void)
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n;
scanf("%d\n",&n);
for (int i=1;i<=n;++i) scanf("%d",S+i);
memset(V,infi,sizeof(V));
int MAX=0;
for (int i=1;i<=n;++i)
{
int low=lower_bound(V+1,V+1+i,S[i])-V;
V[low]=S[i];
s[i]=low;
MAX=max(MAX,low);
}
printf("%d\n",MAX);
for (int i=n,j=MAX;i && j;--i)
if (s[i]==j)
v[j]=S[i],--j;
for (int i=1;i<=MAX;++i) printf("%d ",(v+i));
printf("\n");
return 0;
}