Pagini recente » Cod sursa (job #2405480) | Cod sursa (job #3326107) | Cod sursa (job #1775781) | Cod sursa (job #3294354) | Cod sursa (job #3326079)
#include <iostream>
#include <limits.h>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("scm.in");
ofstream fout("scm.out");
int a[100],i,n,j,lung[100],poz[100];
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
lung[n]=1;poz[n]=-1;
for(i=n-1;i>=1;i--)
{ lung[i]=1;poz[i]=-1;
for(j=n;j>i;j--)
if(a[i]<a[j]&&lung[i]<lung[j]+1)
{ lung[i]=lung[j]+1;
poz[i]=j;
}
}
int maxim=INT_MIN,pozitie;
for(i=1;i<=n;i++)
if(lung[i]>maxim) {maxim=lung[i];pozitie=i;}
fout<<maxim;
fout<<endl;
while(pozitie!=-1)
{
fout<<a[pozitie]<<" ";
pozitie=poz[pozitie];
}
return 0;
}