Cod sursa(job #1561686)
Utilizator | Data | 4 ianuarie 2016 13:47:40 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,v[100002],q=1;
int main()
{
in>>n;
in>>v[1];
int lmax=0;
int l=1;
for(int i=2;i<=n;++i)
{
in>>v[i];
if(v[i]>v[i-1])
++l;
if(v[i]<v[i-1])
{
if(l>lmax)
lmax=l;
l=1;
}
}
if(l>lmax)
lmax=l;
out<<lmax<<'\n';
return 0;
}