Pagini recente » Cod sursa (job #1456523) | Cod sursa (job #1895499) | Cod sursa (job #1299013) | Cod sursa (job #1958363) | Cod sursa (job #2511257)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100001], l[100001] , lmax, poz;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
l[n] = 1;
for(int i = n - 1; i >= 1; i--){
int nr = 0;
for(int j = i; j <= n; j++)
if(v[i] < v[j] && l[j] > nr)
nr = l[j];
l[i] = nr + 1;
if(l[i] > lmax){
lmax = l[i];
poz = i;
}
}
fout << lmax << "\n";
for(int i = poz; i <= n; i++)
if(l[i] == lmax){
fout << v[i] << " ";
lmax--;
}
return 0;
}