Cod sursa(job #2172030)

Utilizator alex02Grigore Alexandru alex02 Data 15 martie 2018 14:39:29
Problema Subsir crescator maximal Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <iostream>
#include <fstream>
using namespace std;

void dinamic(int poz[], int best[], int n, int numere[], int &p, int &maxi)
{
    best[n]=1;
    poz[n]=-1;
    for(int i=n-1;i>=1;i--)
    {
        best[i]=1;
        poz[i]=-1;
        for(int j=i+1; j<=n; j++)
        {
            if(numere[i]<numere[j] && best[i]<best[j]+1)
            {
                best[i]=best[j]+1;
                poz[i]=j;
                if(best[i]>maxi)
                    maxi=best[i],p=i;
            }
        }
    }
}

int main()
{
    ifstream f("scmax.in");
    ofstream g("scmax.out");
    int n, numere[100001], poz[100001], best[100001];
    f>>n;
    for(int i=0; i<n; i++)
        f>>numere[i];
    int p,maxi=0;
    dinamic(poz,best,n,numere,p,maxi);
    g<<maxi<<'\n';
    int index=p;
    while(index!=-1)
    {
        g<<numere[index]<<" ";
        index=poz[index];
    }
    return 0;
}