Cod sursa(job #2812339)
| Utilizator | Data | 4 decembrie 2021 13:38:56 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, x[100001], dp[100001];
void read()
{
in >> n;
for(int i = 1; i <= n; ++i)
in >> x[i];
}
int best(int k)
{
int b = 0;
for(int i = k + 1; i <= n; ++i)
if(x[k] < x[i])
b = max(b, dp[i]);
return b + 1;
}
void afis()
{
int sol = 0;
for(int i = 1; i <= n; ++i)
sol = max(sol, dp[i]);
out << sol;
}
int main()
{
read();
dp[n] = 1;
for(int i = n-1; i > 0; --i)
dp[i] = best(i);
afis();
return 0;
}