Pagini recente » Cod sursa (job #1754440) | Cod sursa (job #1172213) | Cod sursa (job #1767038) | Cod sursa (job #966471) | Cod sursa (job #1026375)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int a[100], l[100], c[100];
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
{
in>>a[i];
l[i]=1;
c[i]=-1;
}
int maxim=0, mm=0;
for(int i=n;i>=1;i--)
for(int j=n;j>i;j--)
if(a[i]<a[j]&&l[j]+1>l[i])
{
l[i]=l[j]+1, c[i]=j;
if(l[i]>=maxim) {maxim=l[i];mm=i;}
}
out<<maxim<<endl;
int pas=0;
while(pas<maxim)
{
out<<a[mm]<<" ";
mm=c[mm];
pas++;
}
return 0;
}