Pagini recente » Cod sursa (job #1961900) | Cod sursa (job #1656558)
#include <cstdio>
#include <algorithm>
#define nmax 100005
using namespace std;
int n,a[nmax],b[nmax];
int lmax,pre[nmax];
int binarys(int val)
{
int sol=0;
for (int i=1<<16;i;i>>=1)
if (sol+i<=lmax&&val>a[b[sol+i]])
sol+=i;
return sol+1;
}
void solution(int m)
{
if (!m)
return;
solution(pre[m]);
printf("%d ",a[m]);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int i,j,poz;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
b[1]=1;lmax=1;
for (i=2;i<=n;i++) {
poz=binarys(a[i]);
pre[i]=b[poz-1];
if (poz>lmax||a[b[poz]]>a[i])
b[poz]=i;
lmax=max(lmax,poz);
}
printf("%d\n",lmax);
solution(b[lmax]);
return 0;
}