Cod sursa(job #2329658)
| Utilizator | Data | 27 ianuarie 2019 11:19:46 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
unsigned long long Lmax (unsigned long long a[],unsigned long long N)
{
unsigned long long dp[N+1],i,j;
for (i=1;i<=N;++i)
{
dp[i]=1;
}
for (i=1;i<=N;++i)
{
for (j=1;j<i;++j)
{
if (a[j]<a[i])
{
dp[i]=max(dp[i],dp[j]+1);
}
}
}
return dp[N];
}
int main()
{
unsigned long long N,a[100001],i;
fin >> N;
for (i=1;i<=N;++i)
{
fin >> a[i];
}
fout << Lmax(a,N);
return 0;
}
