Cod sursa(job #2192772)
Utilizator | Rares Andrei Codreanu RaresANDC | Data | 7 aprilie 2018 11:51:16 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define NMAX 100000
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int n,a[NMAX+5],s[NMAX+5],ok,lmax;
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
{
fin >> a[i];
ok=0;
for(int j=1;j<=i;j++)
{
if(a[i]>a[j]){s[i]=s[j]+1;ok=1;}
}
if(ok==0)s[i]=1;
if(s[i]>lmax)lmax=s[i];
}
fout << lmax;
return 0;
}