Cod sursa(job #1027861)

Utilizator razvan147258369Lucacel Razvan razvan147258369 Data 13 noiembrie 2013 10:25:27
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
using namespace std;

int n,a[1001],l[1001],poz[1001];

int main()
{
    int i,j;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
    }

    l[n]=1; poz[n]=-1;
    for(i=n-1;i>=1;i--)
    {
        for(l[i]=1,poz[i]=-1,j=i+1;j<=n;j++)
        {
            if(a[i]<=a[j]&&l[i]<l[j]+1)
            {
                l[i]=l[j]+1;
                poz[i]=j;
            }
        }
    }

    int max=l[1], pozmax=1;

    for(i=2;i<=n;i++)
    {
        if(max<l[i])
        {
            max=l[i];
            pozmax=i;
        }
    }

    cout<<"Lungimea celui mai lung subsir crescator: " <<max;
    cout<<"\nCel mai lung subsir:\n";

    for (i=pozmax; i!=-1; i=poz[i])
        cout<<a[i]<<' ';

}