Pagini recente » Cod sursa (job #2562923) | Cod sursa (job #1876908) | Cod sursa (job #308203) | Cod sursa (job #2689454) | Cod sursa (job #2040501)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, a[100010], best[100010], prec[100010];
int maxim;
int main()
{
in >> n;
for(int i=1; i<=n; i++)
in >> a[i];
best[n] = 1;
prec[n] = -1;
maxim = 1;
int p =n;
for(int i=n-1; i>=1; i--)
{
best[i] = 1;
prec[i]=-1;
for(int j=i+1; j<=n; j++)
{
if( a[i] <= a[j] && best[j]+1 > best[i])
{
best[i] = best[j] + 1;
if( best[i] >= maxim ) maxim = best[i], p=i;
prec[i]=j;
}
}
}
out << maxim <<'\n';
int i= p;
while( i!=-1 )
{
out << a[i] << ' ';
i = prec[i];
}
return 0;
}