Cod sursa(job #2291099)
Utilizator | Data | 27 noiembrie 2018 16:03:52 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.89 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,a[1000],lmax=1,i,l,j,st,dr;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<n;i++)
{
l=0;
for(j=i+1;j<=n;j++)
{
if(a[i]<a[j]&&a[i]!=a[j])
l++;
}
if(l>lmax)
{
lmax=l;
st=i;
dr=j-1;
}
}
cout<<lmax<<endl;
l=0;
for(i=st;i<=dr;i++)
{
if(l<lmax)
{
if(a[i]==a[i+1])
{
i++;
cout<<a[i]<<" ";
l++;
}
else
{
cout<<a[i]<<" ";
l++;
}
}
}
return 0;
}