Cod sursa(job #3221627)
Utilizator | pepe lepe sweby | Data | 7 aprilie 2024 16:14:12 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
#define NMAX 100000
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int v[NMAX + 1];
int dp[NMAX + 1];
int main(){
int n,i,cnt = 0 ,a,j,cntmax = 0;
cin >> n;
for(i = 1; i <= n; i++){
cin >> v[i];
}
for(i = 1; i <= n; i++){
dp[i] = 1;
for(j = 1; j < i ; j++){
if(v[j] < v[i]){
dp[i] = max(dp[i], dp[j] + 1);
}
}
cntmax = max(dp[i] , cntmax);
}
cout << cntmax;
return 0;
}