Cod sursa(job #1066816)
Utilizator | Data | 25 decembrie 2013 17:55:35 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100005],i,k,c,m;
int main()
{
fin >> n;
for (i=1; i<=n; i++)
fin >> v[i];
c=v[1];
for (i=2; i<=n; i++)
{
if (v[i]>c)
{
k++;
c=v[i];
}
else
{
if (m<k)
m=k;
k=0;
c=v[i];
}
}
fout << m;
fin.close();
fout.close();
return 0;
}