Pagini recente » Cod sursa (job #2293173) | Cod sursa (job #2934291) | Cod sursa (job #230125) | Cod sursa (job #976296) | Cod sursa (job #411574)
Cod sursa(job #411574)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,i,j,a[100000],MAXL,l[100000],u[100000],max=0,pozmax;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
u[i]=0;
l[n]=1;
for(i=n-1;i>=1;i--)
{
MAXL=0;
for(j=i+1;j<=n;j++)
if(a[i]<a[j] && l[j]>MAXL)
{
MAXL=l[j];
u[i]=j;
}
l[i]=MAXL+1;
if(max<l[i])
{
max=l[i];
pozmax=i;
}
}
fout<<max<<'\n';
for(i=pozmax;i!=0;i=u[i])
fout<<a[i]<<' ';
fin.close();
fout.close();
return 0;
}