Cod sursa(job #1901729)
| Utilizator | Data | 4 martie 2017 10:52:19 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#define nmax 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i;
long a[nmax];
int LIS()
{
int i,j,lis[nmax],nr;
for(i=1;i<=n;i++)lis[i]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=i-1;j++)if(a[j]<a[i])lis[i]=max(lis[i],lis[j]+1);
nr=max(nr,lis[i]);
}
return nr;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)fin>>a[i];
fout<<LIS()<<endl;
return 0;
}
