Cod sursa(job #2326178)
| Utilizator | Data | 23 ianuarie 2019 13:08:51 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.49 kb |
#include <fstream>
#define len 100000
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int N, v[len], dp[len], cmax;
int main()
{
in >> N;
for(int i = 0; i < N; ++i)
in >> v[i];
dp[0] = 1;
for(int i = 1; i < N; ++i)
{
if(v[i] > v[i - 1] && v[i] > cmax)
{
dp[i] = dp[i - 1] + 1;
cmax = v[i];
}
else dp[i] = dp[i - 1];
}
out << dp[N - 1];
return 0;
}
