Pagini recente » Cod sursa (job #3140768) | Cod sursa (job #1439204) | Cod sursa (job #444040) | Cod sursa (job #1928426) | Cod sursa (job #1369578)
#include <iostream>
#include <fstream>
using namespace std;
long long a[100001],l[100001],i,Max,j,k,n;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
for (i=1; i<=n; i++) f>>a[i];
l[n]=1;
for (i=n-1; i>=1; i--)
{
Max=0;
for (j=i+1; j<=n; j++) if (a[i]<a[j])
{
if (l[j]>Max) Max=l[j];
}
l[i]=Max+1;
}
Max=0;
for (i=1; i<=n; i++)
{
if (l[i]>Max) Max=l[i];
}
g<<Max<<'\n';
for (i=1; i<=n; i++)
{
if (l[i]==Max)
{
for (k=1; k<=Max; k++)
{
g<<a[i]<<' ';
for (j=i+1; j<=n; j++) if (a[j]>a[i] && l[j]==(l[i]-1))
{
break;
}
i=j;
}
}
}
return 0;
}