Pagini recente » Cod sursa (job #2221782) | Cod sursa (job #3188892) | Cod sursa (job #458809) | Cod sursa (job #2349020) | Cod sursa (job #1781847)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, arr[100001], poz[100001], L[100001], Max , p;
void Read()
{
in >> n;
for(int i = 1; i <= n; ++i)
in >> arr[ i ];
}
void Solve()
{
poz[n] = -1;
L[n] = 1;
for(int i = n - 1; i >= 1; --i)
{
poz[i] = -1, L[i] = 1;
for(int j = i + 1; j <= n; ++j)
{
if(arr[i] < arr[j] && L[j] + 1 > L[i])
{
poz[i] = j;
L[i] = L[j] + 1;
}
}
}
}
void Print()
{
int i;
p = n;
for(i = 1; i <= n; ++i)
{
if(L[i] > Max)
{
Max = L[i];
p = i;
}
}
i = p;
out << Max << '\n';
while(i != -1)
{
out << arr[i] << ' ';
i = poz[i];
}
}
int main()
{
Read();
Solve();
Print();
}