Pagini recente » Cod sursa (job #915548) | Cod sursa (job #1963334) | Cod sursa (job #1443250) | Cod sursa (job #2743882) | Cod sursa (job #2812344)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,a[100003],L[100003],T[100003];
void cauta()
{int l,dr,lmax=0,stmax=0,i,j,rez;
for(i=n;i>=1;i--)
{
l=0;
dr=i;
for(j=i+1;j<=n;j++)
{
if(a[i]<=a[j]&&l<L[j])
{
l=L[j];
dr=j;
}
}
T[i]=dr;
L[i]=l+1;
if(L[i]>lmax)
{
lmax=L[i];
stmax=i;
}
}
cout<<lmax<<'\n';
rez=stmax;
for(;rez!=T[rez];rez=T[rez])
cout<<a[rez]<<" ";
cout<<a[rez];
}
int main()
{int i;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cauta();
return 0;
}