Pagini recente » Cod sursa (job #2302021) | Cod sursa (job #2332418) | Cod sursa (job #2362882) | Cod sursa (job #1721997) | Cod sursa (job #1535253)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[100001],l[100001],i,j;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
int Max;
a[n]=1;
for(i=n-1;i>0;i--)
{
Max=0;
for(j=i+1;j<=n;j++)
if(a[i]<=a[j]&&Max<l[j])Max=l[j];
l[i]=Max+1;
}
Max=0;
int k;
for(i=1;i<=n;i++)
if(l[i]>Max)Max=l[i],k=i;
g<<Max<<"\n";
for(i=k;i<=n&&Max;i++)
if(l[i]==Max)
{
g<<a[i]<<" ";
Max--;
}
return 0;
}