Cod sursa(job #2308219)
Utilizator | Data | 26 decembrie 2018 17:33:17 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#define max(a, b) (a>b) ? a : b
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n, m=0;
long long a[100000], b[100000];
int main() {
cin>>n;
for(int i=0; i<n; i++)
cin>>a[i];
for(int i=1; i<n; i++)
for(int j=0; j<i; j++)
if(a[j]<a[i])
b[i]=max(b[i], b[j]+1), m=max(m, b[i]);
cout<<m+1;
return 0;
}