Cod sursa(job #1529933)
Utilizator | Data | 21 noiembrie 2015 11:36:43 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[100],l[100];
int main()
{
int n,mx=1;
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
l[1]=1;
for(int i=2;i<=n;i++){
int cmax=0;
for(int j=1;j<i;j++){
if(a[i]>a[j] && l[j]>cmax)
cmax=l[j];
}
l[i]=cmax+1;
mx=max(mx,l[i]);
}
g<<mx<<endl;
return 0;
}