Cod sursa(job #1117347)

Utilizator marta_diannaFII Filimon Marta Diana marta_dianna Data 23 februarie 2014 13:46:47
Problema Subsir 2 Scor 12
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.71 kb
#include<fstream>
#define NMAX 5010

using namespace std;

ifstream f("subsir2.in");
ofstream g("subsir2.out");

int n, a[NMAX], lg[NMAX], prec[NMAX], vz[NMAX];

void Citeste()
{
    int i;
    f>>n;
    for (i=1; i<=n; ++i) f>>a[i];
}

bool bun(int p, int u)
{
    int v=a[p], w=a[u], k;

    for (k=p+1; k<u; ++k)
        if (a[k]>=v && a[k]<=w) return 0;

    return 1;
}

void Solve()
{
    int i, j, mn, valmn;

    for (i=n; i>0; --i)
    {
        mn=n+1;
        for (j=i+1; j<=n; ++j)
           // if (!vz[j])
                if (a[j]>a[i] && bun(i, j))
                {
                    if (lg[j]<mn)
                    {
                        mn=lg[j];
                        valmn=j;
                    }
                    else
                        if (lg[j]==mn && a[j]<a[valmn]) valmn=j;
                   // vz[j]=1;
                }
        if (mn==n+1)
        {
            lg[i]=1;
            prec[i]=-1;
        }
        else
        {
            lg[i]=mn+1;
            prec[i]=valmn;
        }
    }
}

void Afis(int x)
{
    if (x!=-1)
    {
        g<<x<<" ";
        Afis(prec[x]);
    }
}

bool solutie(int x)
{
    int i;
    for (i=1; i<x; ++i)
        if (a[x]>a[i]) return 0;
    return 1;
}

void Scrie()
{
    int i, mn=n+1, imn;
    for (i=1; i<=n; ++i)
        if (solutie(i))
            if (mn>lg[i])
            {
                mn=lg[i];
                imn=i;
            }
            else
                if (mn==lg[i] && a[imn]>a[i])  imn=i;
    g<<mn<<"\n";
    Afis(imn);
}

int main()
{
    Citeste();

    Solve();

    Scrie();

    f.close();
    g.close();
    return 0;
}