Cod sursa(job #1050923)
| Utilizator | Data | 9 decembrie 2013 14:10:53 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,a[100],l[100];
cin>>n;
for(int i=1; i<=n; i++) cin>>a[i];
l[n]=1;
int mmax=0;
for(int i=n-1; i>=1; i--)
{
int max=0;
for(int j=i+1; j<=n; j++)
{
if(a[j]>a[i] && l[j]>max)
max=l[j];
l[i]=max+1;
}
if(mmax<l[i]) mmax=l[i];
}
for(int i=1; i<=n; i++)
{
if(l[i]==mmax)
{
cout<<a[i]<<" ";
mmax--;
}
}
return 0;
}
