Cod sursa(job #2929665)
Utilizator | Data | 26 octombrie 2022 14:02:52 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, sol;
int v[100005], dp[100005];
int main()
{
fin >> n;
for(int i = 1; i <= n; i ++)
{
fin >> v[i];
for(int j = 1; j <= i; j ++)
if(v[j] < v[i])
dp[i] = max(dp[i], dp[j]);
dp[i] ++;
sol = max(sol, dp[i]);
}
fout << sol;
return 0;
}