Cod sursa(job #1044633)
Utilizator | Data | 30 noiembrie 2013 10:04:27 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
using namespace std;
int a[100],b[100];
int main()
{
int i,n,j,max,max2;
cin>>n;
for (i=1;i<=n;i++)
{
cin>>a[i];
}
b[1]=1;
for (i=2;i<=n;i++)
{
max=0;
for(j=i-1;j>=1;j--)
{
if(a[j]<a[i])
{
if(max<b[j])
{
max=b[j];
}
}
}
b[i]=max+1;
}
max2=0;
for(i=1;i<=n;i++)
{
if (b[i]>=max2)
{
max2=b[i];
}
cout<<b[i];
}
}