Cod sursa(job #2082410)

Utilizator Zamfirescuste2Zamfirescu Stefan Zamfirescuste2 Data 6 decembrie 2017 09:08:19
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <bits/stdc++.h>
using namespace std;
int v[101], s[101],lung[101],n,i,max1,j,m,t[101];
int main()
{
    freopen( "scmax.in" , "r", stdin);
    freopen( "scmax.out", "w", stdout);
    scanf( "%d" , &n);
    for ( i = 1; i <= n; i++ )
    {
        scanf( "%d" , &v[i]);
        j = 1;
        while ( s[j] < v[i] && j <= max1 )
            j++;
        s[j] = v[i];
        lung[i] = j;
        if ( j > max1 )
            max1 = j;
    }
    m = max1;
    for (i = n; i >= 0; i-- )
    {
        if ( lung[i] == m )
        {
            t[m--] = v[i];

        }
    }
    for (i = 1; i <= max1; i++ )
        printf( "%d " , t[i]);
    return 0;
}