Cod sursa(job #1555620)
| Utilizator | Data | 23 decembrie 2015 11:59:19 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
/*
*/
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin(" scmax.in");
ofstream fout("scmax.out");
int main()
{
float N,G[100000],D[100000];
fin>>N;
for (int i=1;i<=N;i++)
fin>>G[i];
D[1]=1; int max;
for(int i=2;i<=N;i++)
{
if(G[i]>G[i-1])
{
D[i]=D[i-1]+1;
max=D[i];
}
else
D[i]=D[i-1];
}
/* int max=-999999;
for(int i=1;i<=N;i++)
if(D[i]>max)
max=D[i];*/
fout<<max;
return 0;
}
