Cod sursa(job #2364806)
| Utilizator | Data | 4 martie 2019 10:54:39 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | pregatire_cls12_oji | Marime | 0.53 kb |
#include <bits/stdc++.h>
#define len 100000
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
unsigned N, lmax, v[len], scmax[len];
int main()
{
in >> N;
for(unsigned i = 0; i < N; ++i)
{
in >> v[i];
scmax[i] = 1;
for(unsigned j = 0; j < i; ++j)
if(v[j] < v[i])
{
scmax[i] = max(scmax[i], scmax[j] + 1);
lmax = max(lmax, scmax[i]);
}
}
out << lmax << '\n';
return 0;
}
