Pagini recente » Cod sursa (job #560603) | Cod sursa (job #1965161) | 45 | Cod sursa (job #2353510) | Cod sursa (job #2082410)
#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;
}