Pagini recente » Cod sursa (job #979263) | Cod sursa (job #1954385) | Cod sursa (job #1977555) | Cod sursa (job #2088520) | Cod sursa (job #1120793)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long v[100000], l[100000];
int i,n,poz[100000],ml,pl,j;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
l[n]=1; poz[n]=0;
for (i=n-1;i>=1;i--)
{
ml=0;pl=0;
for (j=i+1;j<=n;j++)
if(l[j]>ml && v[i]<v[j])
{
ml=l[j];
pl=j;
}
l[i]=1+ml; poz[i]=pl;
}
ml=0; pl=0;
for (i=1;i<=n;i++)
if (ml<l[i])
{
ml=l[i];
pl=i;
}
fout<<ml<<'\n';
for (i=pl;i!=0;i=poz[i])
fout<<v[i]<<' ';
fout.close();
fin.close();
return 0;
}