Pagini recente » Cod sursa (job #884296) | Cod sursa (job #473969) | Cod sursa (job #2269989) | Cod sursa (job #2912502) | Cod sursa (job #1293725)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int n,k,st,dr,i,m,p,nr,z,a[100001],b[100001],v[100001],c[100001];
int main()
{
fin >>n;
k=0;
for (i=1;i<=n;i++)
{
fin >>v[i];
st=1;dr=k;p=0;
while (st<=dr)
{
m=(st+dr)/2;
if(v[i]<=a[m])
{
p=m;
dr=m-1;
}
else
{
st=m+1;
}
}
if(p!=0){
a[p]=v[i];
b[i]=p;
}
else
{
k++;
a[k]=v[i];
b[i]=k;
}
}
z=n;
fout<<k<<'\n';
while(k>0)
{
for(i=n;i>=0;i--)
if(b[i]==k)
{
c[++nr]=v[i];
break;
}
k--;
z=n;
}
for(i=nr;i>0;i--)
fout <<c[i]<<" ";
return 0;
}