Cod sursa(job #2835468)
| Utilizator | Data | 18 ianuarie 2022 19:27:30 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define MAXN 100005
int n;
int a[MAXN], dp[MAXN];
int maxx = INT_MIN, cont;
int poz = 1;
int main() {
fin >> n;
for (int i = 1; i <= n; i ++)
fin >> a[i];
for (int i = 1; i <= n; i++) {
dp[i] = 1;
for (int j = 1; j < i; j ++)
if (a[j] < a[i])
dp[i] = max(dp[i], dp[j] + 1);
if (dp[i] > dp[poz])
poz = i;
}
fout << dp[poz];
return 0;
}