Cod sursa(job #2694928)
Utilizator | Balint Leonard ProBatman | Data | 11 ianuarie 2021 09:19:14 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <stdio.h>
using namespace std;
const int CMAX = 1e5+15;
int v[CMAX] , n , val[CMAX] , maxim = 1;
int main()
{
freopen ("scmax.in","r",stdin);
freopen ("scmax.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
val[1] = 1;
for(int i=2;i<=n;i++)
{
val[i] = 1;
for(int j=i-1;j>=1;j--)
{
if(v[i]>v[j])
val[i] = max(val[i],val[j]+1);
}
maxim = max(maxim,val[i]);
}
printf("%d",maxim);
return 0;
}