Cod sursa(job #2148359)

Utilizator vladsftVlad Safta vladsft Data 1 martie 2018 18:00:34
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>

using namespace std;

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

const int N = 100001;

int n, v[N], lung[N], m;

void print(int i) {
    if (lung[i] == 1) {
        g << v[i] << ' ';
        return;
    }
    int j;
    for (j = i - 1; j > 0 && lung[i] - 1 != lung[j]; j--);
    print(j);
    g << v[i] << ' ';
}

int main()
{
    int poz = 0;
    f >> n;
    for (int i = 1; i <= n; i++) {
        f >> v[i];
        for (int j = 1; j < i; j++) {
            if (v[j] < v[i]) lung[i] = max(lung[i], lung[j]);
        }
        lung[i]++;
        if (m < lung[i]) {
            m = lung[i];
            poz = i;
        }
    }
    print(poz);
}