Pagini recente » Cod sursa (job #242993) | Cod sursa (job #2313289) | Cod sursa (job #1288965) | Cod sursa (job #2288959) | Cod sursa (job #3174397)
#include <iostream>
#include <fstream>
using namespace std;
int n;
int a[100005];
int l[100005];
int pozmax=0;
void gasire()
{
for(int i=n; i>=1; i--)
{
l[i] = 1;
for (int j = i + 1; j <= n; j++)
if (a[i] < a[j] && l[j] + 1 > l[i]) {
l[i] = l[j] + 1;
}
pozmax=max(pozmax, l[i]);
}
}
void afisare()
{
for(int i=1; i<=n && pozmax!=0; i++)
{
if(l[i]==pozmax)
{
cout << a[i] << " ";
pozmax--;
}
}
}
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
cin >> a[i];
gasire();
cout << pozmax << "\n";
afisare();
return 0;
}