Cod sursa(job #362929)
| Utilizator | Data | 11 noiembrie 2009 12:48:02 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int l[100002],a[100002];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
l[1]=1;
int max=1;
for(int i=2;i<=n;i++)
{
for(int j=i-1;j>0;j--)
if(a[i]>a[j])
if(l[i]<l[j]+1)l[i]=l[j]+1;
if(l[i]>max)max=l[i];
}
cout<<max;
return 0;
}
