Cod sursa(job #2542612)
| Utilizator | Data | 10 februarie 2020 12:10:12 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#define maxn 100005
using namespace std;
int n,v[maxn];
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int recursiv(int l,int min){
if(l==0)
return 0;
if(min<=v[l])
return max(recursiv(l-1,min),1+recursiv(l-1,v[l]));
return recursiv(l-1,min);
}
int main(){
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
cout<<recursiv(n,1);
return 0;
}
