Pagini recente » Cod sursa (job #1509133) | Cod sursa (job #1165360) | Cod sursa (job #3153446) | Cod sursa (job #2578717) | Cod sursa (job #2672906)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int Nmax = 1e5 + 5;
int L[Nmax],
V[Nmax],
Next[Nmax],
n;
int main()
{
in>>n;
for(int i = 1; i <= n; i++)
in>>V[i];
L[n] = 1;
Next[n] = -1;
for(int i = n - 1; i > 0; i--)
{
L[i] = 1, Next[i] = -1;
for(int j = i + 1; j <= n ; j++)
if(V[i] < V[j] && L[j] + 1 > L[i])
{
//L[i] = max(L[j]+1, L[i]);
L[i] = L[j] + 1;
Next[i] = j;
}
}
int pMax = 1;
for(int i = 1; i <= n; i++)
if(L[pMax] < L[i])
pMax = i;
out<<L[pMax]<<'\n';
int k = pMax;
while(k != -1)
{
out<<V[k]<<' ';
k = Next[k];
}
return 0;
}