Pagini recente » Cod sursa (job #897480) | Cod sursa (job #1937992) | Cod sursa (job #1626819) | Borderou de evaluare (job #1036270) | Cod sursa (job #729931)
Cod sursa(job #729931)
#include<fstream>
using namespace std;
#define dm 100001
long long v[dm];
long long urm[dm];
int main()
{
ifstream fcin("scmax.in");
ofstream fcout("scmax.out");
int n,i,j,l,poz;
fcin>>n;
int max[dm];
for(i=1;i<=n;i++)
fcin>>v[i];
max[n]=1;
urm[n]=-1;
for(i=n-1;i>0;i--)
{
max[i]=1;
urm[i]=-1;
for(j=i+1;j<=n;j++)
if(v[i]<v[j] && max[i]<=max[j])
{
max[i]=max[j]+1;
urm[i]=j;
}
}
for(i=1;i<=n;i++)
if(max[i]>l)
{
l=max[i];
poz=i;
}
fcout<<l<<"\n";
for(i=1;i<=l;i++)
{
fcout<<v[poz]<<" ";
poz=urm[poz];
}
return 0;
}