Pagini recente » Cod sursa (job #2694504) | Cod sursa (job #1625097) | Cod sursa (job #1312960) | Cod sursa (job #853604) | Cod sursa (job #1535147)
#include <fstream>
using namespace std;
int n,l[10001],a[10001],p,max1,j,i;
int main()
{ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)f>>a[i];
for(i=n;i>=1;i--)
{max1=0;
for(j=i+1;j<=n;j++)
{if(l[j]>max1&&a[j]>a[i])
max1=l[j];
}
l[i]=max1+1;
}
max1=0;
for(i=1;i<=n;i++)
{if(l[i]>max1){max1=l[i];p=i;}}
g<<max1<<'\n';
while(max1>0)
{g<<a[p]<<" ";
max1--;
for(i=p+1;i<=n;i++)
if(a[i]>a[p]&&l[i]==max1)
{p=i;
break;
}
}
return 0;
}