Cod sursa(job #1044000)
Utilizator | Data | 29 noiembrie 2013 09:49:05 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int main()
{
int n,i,j,a[100001],lis[10001],nr[100001],maxx;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
lis[n]=1;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
if(maxx<lis[j]&&a[i]<a[j])
maxx=lis[j];
lis[i]=maxx+1;
}
maxx=0;
for(i=1;i<=n;i++)
{
if(maxx<lis[i])
maxx=lis[i];
}
cout<<maxx;
}