Cod sursa(job #2485964)
Utilizator | Data | 2 noiembrie 2019 10:53:17 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long n,a[100003],l=1,L=0;
int main()
{
fin>>n;
for (int i=1;i<=n;i++)fin>>a[i];
for (int i=2;i<=n;i++){
if (a[i]>a[i-1])l++;
if (a[i]==a[i-1])l=l;
if (a[i]<a[i-1])
{
if(l>L)
L=l;
l=1;
}
}
if (l>L)L=l;
cout<<L;
return 0;
}