Pagini recente » Cod sursa (job #2283022) | Cod sursa (job #3151693) | Cod sursa (job #2167507) | Cod sursa (job #203381) | Cod sursa (job #1075143)
#include <cstdio>
using namespace std;
int i,n,stiv[100001],a[100001],pos[100001],m,cm,xx[100001];
int bin(int m,int x,int stiv[])
{
int poz=0,mij,st,dr;
st=1;
dr=m;
while (st<=dr&&!poz)
{
mij=(st+dr)/2;
if (stiv[mij]>x)dr=mij-1;
else if (stiv[mij]<x) st=mij+1;
else poz=mij;
}
if (poz==0)return st;
else return poz;
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++)
scanf("%d",&a[i]);
stiv[1]=a[1];
pos[1]=1;
m=1;
for (i=2; i<=n; i++)
{
stiv[bin(m,a[i],stiv)]=a[i];
if (bin(m,a[i],stiv)>m)m++;
pos[i]=bin(m,a[i],stiv);
}
printf("%d\n",m);
cm=m;
for (i=n; i>=1&&cm!=0; i--)
{
if (pos[i]==cm)
{
xx[cm]=a[i];
cm--;
}
}
for (i=1; i<=m; i++)
printf("%d ",xx[i]);
return 0;
}