Pagini recente » Cod sursa (job #1710333) | Cod sursa (job #1898834) | Cod sursa (job #1377166) | Cod sursa (job #788889) | Cod sursa (job #2152692)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long n,a[100009],i,j,lmax,b[100009],nr,l,c[100009];
int main()
{
fin>>n;
for(i=1;i<=n;i=i+1)
{
fin>>a[i];
}
lmax=1;
for(i=1;i<=n-lmax;i=i+1)
{
nr=a[i];
l=1;
b[l]=a[i];
for(j=i+1;j<=n;j=j+1)
{
if(a[i]<a[j] && nr<a[j])
{
l=l+1;
nr=a[j];
b[l]=nr;
}
else
{
if(a[i]<a[j] && nr>a[j])
{
nr=a[j];
b[l]=nr;
}
}
}
if(l>lmax)
{
lmax=l;
for(j=1;j<=lmax;j=j+1)
{
c[j]=b[j];
}
}
}
fout<<lmax<<"\n";
for(i=1;i<=lmax;i=i+1)
{
fout<<c[i]<<" ";
}
fin.close();
fout.close();
return 0;
}