Cod sursa(job #1529769)
Utilizator | Data | 21 noiembrie 2015 11:11:21 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("date.in");
ofstream g("date.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 cmx=0;
for(int j=1;j<i;j++){
if(a[i]>a[j])
cmx=max(l[j],cmx);
}
l[i]=cmx+1;
///cyka blyat
mx=max(mx,l[i]);
}
g<<mx;
return 0;
}