Cod sursa(job #1984724)
Utilizator | Data | 25 mai 2017 19:15:56 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int n,A[100010],D[100010],m;
int main(){
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
cin>>n;
for (int i=1; i<=n; i++) cin>>A[i],D[i]=1;
for (int i=2; i<=n; i++){
for (int j=1; j<i; j++){
if (A[i]>A[j]) D[i]=max(D[i],D[j]+1), m=max(D[i],m);
}
}
cout<<m;
return 0;
}