Pagini recente » Cod sursa (job #608387) | Borderou de evaluare (job #423115) | Cod sursa (job #1402431) | Cod sursa (job #1064814)
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n;
long long v[100001];
int l[100001],poz[100001];
int main()
{
int i,j;
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
int Max=1,p;
l[n]=1; poz[n]=-1;
for (i=n-1;i>0;i--)
for (l[i]=1,poz[i]=-1,j=i+1;j<=n;j++)
if (v[j]>v[i] && l[i]<1+l[j])
{
l[i]=1+l[j]; poz[i]=j;
if(l[i]>Max) Max=l[i],p=i;
}
fout<<Max<<'\n';
for(i=p;i!=-1;i=poz[i])
fout<<v[i]<<' ';
return 0;
}