Cod sursa(job #1527999)

Utilizator bpalaniciPalanici Bogdan bpalanici Data 18 noiembrie 2015 22:28:04
Problema Subsir crescator maximal Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h>

using namespace std;

int sir[1005], n, lenmax, ilenmax;
int rez[1005];
int d[1005];

void drum(int x)
{
    if (x == rez[x] || !rez[x]) {printf("%d ", sir[x]); return;}
    drum(rez[x]);
    printf("%d ", sir[x]);
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &sir[i]);
    rez[1] = 1;
    d[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        int newlen = 0, inewlen = i;
        for (int i1 = 1; i1 < i; i1++)
            if (sir[i1] < sir[i] && d[i1] > newlen)
                newlen = d[i1], inewlen = i1;
        d[i] = newlen + 1;
        rez[i] = inewlen;
    }
    for (int i = 1; i <= n; i++)
        if (lenmax < d[i])
            lenmax = d[i], ilenmax = i;
    printf("%d\n", lenmax);
    drum(ilenmax);
    return 0;
}