Pagini recente » Cod sursa (job #3263005) | Cod sursa (job #1490283) | Cod sursa (job #196341) | Cod sursa (job #2740557) | Cod sursa (job #1170565)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long v[100000],l[100000],r[100000];
int n,i,j;
int main()
{
long long max,p;
fin>>n;
for (i=1;i<=n;++i)
fin>>v[i];
l[n]=1; r[n]=0;
for (i=n-1;i>=1;--i)
{
max=0; p=0;
for (j=i+1;j<=n;j++)
if (v[i]<v[j]&&l[j]>max)
{
max=l[j];
p=j;
}
l[i]=max+1;
r[i]=p;
}
max=l[1]; p=1;
for (i=2;i<=n;++i)
if (l[i]>max)
{
max=l[i];
p=i;
}
fout<<max<<'\n';
while (p>0)
{
fout<<v[p]<<" ";
p=r[p];
}
return 0;
}