Cod sursa(job #1596142)
Utilizator | Data | 10 februarie 2016 20:19:51 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100001],i,l,lmax,dr;
int main()
{
fin>>n;
fin>>v[1];
lmax=-1;
l=1;
for(i=2; i<=n; i++)
{
fin>>v[i];
if(v[i]>=v[i-1])
{
if(v[i]>v[i-1])
l++;
}
else
{
if(l>lmax)
{
lmax=l;
dr=i-1;
}
l=1;
}
}
if(l>lmax)
{
lmax=l;
dr=i-1;
}
fout<<lmax<<'\n';
for(i=dr-lmax; i<=dr; i++)
if(v[i]!=v[i-1])
fout<<v[i]<<' ';
fin.close();
fout.close();
return 0;
}