Cod sursa(job #3317606)
| Utilizator | Data | 24 octombrie 2025 17:19:15 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main(){
int n;
fin>>n;
vector<int> v(1002),lg(1002);
for(int i=1;i<=n;i++) fin>>v[i];
lg[n]=1;
for(int i=n-1;i>0;i--){
lg[i]=1;
for(int j=i+1;j<=n;j++){
if(v[i]<=v[j]&&lg[i]<lg[j]+1){
lg[i]=lg[j]+1;
}
}
}
int max=1;
for(int i=1;i<=n;i++) if(lg[i]>max) max=lg[i];
fout<<max<<endl;
return 0;
}
