Pagini recente » Cod sursa (job #2151305) | Cod sursa (job #1368938) | Cod sursa (job #1066628) | Cod sursa (job #2077684) | Cod sursa (job #2068225)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,Max,p,j,a[10005],l[100005],lmax,ult;
int main()
{
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
l[n]=1;
lmax=0;
for (i=n-1; i>=1; i--)
{
Max=0;
for (j=i+1; j<=n; j++)
if (a[j]>a[i] && Max<=l[j]) Max=l[j];
l[i]=Max+1;
if (lmax<l[i])
{
lmax=l[i];
p=i;
}
}
g<<lmax<<'\n';
ult=a[p]-1;
for (i=p; i<=n; i++)
if (a[i]>ult && l[i]==lmax)
{
g<<a[i]<<" ";
ult=a[i];
lmax--;
}
return 0;
}