Pagini recente » Cod sursa (job #188003) | Cod sursa (job #1058532) | Cod sursa (job #1503343) | Cod sursa (job #1288626) | Cod sursa (job #1049150)
#include <fstream>
#include <iostream>
#include <cstdio>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, k, t;
int v[100003], lung[100003];
int indice, maxl;
void printSub(){
g << v[t] << " ";
for(int i = 1; i <= n; i++)
if(lung[i] == maxl - 1) {
g << v[i] << " ";
maxl --;
}
}
int main()
{
f >> n;
for(int i = 1; i <= n; i++)
f >> v[i];
lung[n] = 1;
for(int i = n-1; i >=1; i--){
int mx = 0;
for(int j = i+1; j <=n; j++){
if(v[i] < v[j] && lung[j] > mx) {
mx = lung[j];
}
lung[i] = mx + 1;
if(lung[i]>maxl)
{maxl=lung[i];
t=i;}
}
}
g << maxl << "\n";
printSub();
return 0;
}