Pagini recente » Cod sursa (job #2394272) | Cod sursa (job #3219702) | Cod sursa (job #581054) | Cod sursa (job #2851386) | Cod sursa (job #2760631)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100005], dp[100005], ans[100005];
int n, poz, k;
void citire()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> a[i];
}
}
void solve()
{
int t, valdp;
for(int i = 1; i <= n; i++)
{
dp[i] = 1;
for(int j = 1; j < i; j++)
{
if(a[i] > a[j])
dp[i] = max(dp[i], 1 + dp[j]);
}
}
for(int i = 1; i <= n; i++)
{
if(dp[i] > dp[poz])
{
poz = i;
}
}
fout << dp[poz] << "\n";
ans[++k] = a[poz];
valdp = dp[poz];
for(t = poz - 1; t >= 1; t--)
{
if(dp[t] + 1 == dp[poz] && a[t] < a[poz])
{
poz = t;
ans[++k] = a[poz];
}
}
for(int i = k; k >= 1; k--)
{
fout << ans[k] << " ";
}
}
int main()
{
citire();
solve();
return 0;
}