Pagini recente » Cod sursa (job #2805073) | Borderou de evaluare (job #1298380) | Borderou de evaluare (job #3151553) | Borderou de evaluare (job #1548168) | Cod sursa (job #2389239)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[100010], scmax[100010], prev[100010], maxim = 0;
int main()
{
f >> n;
for(int i = 0; i < n; i++)
f >> v[i];
scmax[n - 1] = 1;
for(int i = n - 1; i >= 0; i --)
{
for(int j = i + 1; j < n; j++)
if(v[i] < v[j])
{
if(scmax[i] < scmax[j] + 1)
{
scmax[i] = scmax[j] + 1;
if(scmax[i] > scmax[maxim]) maxim = i;
prev[i] = j;
}
}
if(scmax[i] == 0) scmax[i] = 1;
}
g << scmax[maxim] << '\n';
while(prev[maxim])
{
g << v[maxim] << ' ';
maxim = prev[maxim];
}
g << v[maxim] << ' ';
f.close();
g.close();
return 0;
}