Pagini recente » Cod sursa (job #801786) | Cod sursa (job #2666430) | Cod sursa (job #2372792) | Cod sursa (job #560133) | Cod sursa (job #1077604)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int n,i,j,max,p,v[100],l[100],urm[100];
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
l[n]=1;
urm[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;
urm[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=urm[p];
}
fin.close();
fout.close();
return 0;
}