Cod sursa(job #1322614)
Utilizator | Data | 20 ianuarie 2015 10:39:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
long long n,v[1000],lmax=0,l,i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l=1;
for(i=2;i<=n;i++){
if(v[i]>=v[i-1]) l++;
else l=1;
if(v[i]==v[i-1]) l--;
if(l>lmax) lmax=l;
}
g<<lmax;
return 0;}