Cod sursa(job #1712785)
| Utilizator | Data | 3 iunie 2016 18:01:07 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,imax,j=1,v[100001],st,nr=1;
int main()
{
f>>n>>v[1];
for(i=2; i<=n; i++){ f>>v[i];
if(v[i-1]<=v[i]){ nr++;
if(v[i-1]!=v[i])j++;
}
else { if(j>imax)imax=j;
st=i;
j=1;
}
}
if(imax<j)imax=j;
cout<<imax<<endl;
for(i=st; i<=nr+st; i++)if(v[i]!=v[i+1])cout<<v[i]<<" ";
cout<<endl;
return 0;
}
