Cod sursa(job #2353946)
Utilizator | Data | 24 februarie 2019 19:02:34 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,cnt,a[100001],b[100001];
int main(){
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i];
b[n]=1;
for(int i=n-1; i>0; i--){
b[i]=1;
for(int j=i+1; j<=n; j++)
if(a[i]<a[j]&& b[i]<=b[j])
b[i]=b[j]+1;
cnt=max(cnt,b[i]);
}
cout<<cnt<<' ';
return 0;
}