Cod sursa(job #3208299)
| Utilizator | Data | 28 februarie 2024 10:46:46 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | 28_februarie_simulare_oji_2024_clasele_11_12 | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[10000001];
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
int lgmax = 0;
for (int i = 1; i < n; ++i) {
int lg = 1;
int aux = v[i];
for (int j = i + 1; j <= n; ++j) {
if (v[j] > aux) {
aux = v[j];
++lg;
}
}
if (lg > lgmax) {
lgmax = lg;
}
}
fout << lgmax;
return 0;
}
