Pagini recente » Cod sursa (job #2840365) | Cod sursa (job #2022674) | Cod sursa (job #982166) | Cod sursa (job #2907514) | Cod sursa (job #361340)
Cod sursa(job #361340)
#include <fstream>
#include <conio.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{long a[100001],b[100001],pre[100001],p,i,j,n,max,f[100000];
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
b[1]=1;
pre[1]=0;
for(i=2;i<=n;i++)
{max=0;
pre[i]=0;
for(j=1;j<i;j++)
if(a[i]>a[j]&&b[j]>max){max=b[j];pre[i]=j;}
b[i]=max+1;
}
max=0;
for(i=1;i<=n;i++)
if(b[i]>max){max=b[i];p=i;}
fout<<max<<endl;
n=max;
f[n--]=a[p];
while(pre[p]!=0)
{
p=pre[p];
f[n--]=a[p];
}
for(i=1;i<=max;i++)
fout<<f[i]<<" ";
return(0);
}