Pagini recente » Cod sursa (job #80599) | Cod sursa (job #3204715) | Cod sursa (job #39151) | Cod sursa (job #3158153) | Cod sursa (job #1570195)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int l[10001],a[10001];
long long mx,k,n;
void solve()
{
int i,j;
l[n]=1;
for (i=n-1; i>=1; i--)
{
mx=0;
for (j=i+1; j<=n; j++)
{
if (l[j]>mx&&a[i]<a[j])mx=l[j];
l[i]=mx+1;
}
}
mx=0;
for (i=1; i<=n; i++)
{
if (l[i]>mx)
{
mx=l[i];
k=i;
}
}
}
void afis()
{
int i;
g<<mx<<'\n';
for (i=k; i<=n&&mx; i++)
{
if (l[i]==mx)
{
g<<a[i]<<" ";
mx--;
}
}
}
int main()
{
int i;
f>>n;
for (i=1; i<=n; i++)
{
f>>a[i];
}
solve();
afis();
return 0;
}