Cod sursa(job #3296699)
Utilizator | Data | 15 mai 2025 16:52:24 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int n,d[100005],v[100005];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
}
d[1]=1;
for(int i=2;i<=n;i++){
d[i]=1;
for(int j=1;j<i;j++){
if(v[j]<v[i]){
///candidate
d[i]=max(d[i],d[j]+1);
}
}
}
int maxi=1;
for(int i=1;i<=n;i++){
maxi=max(maxi,d[i]);
}
cout<<maxi;
return 0;
}