Pagini recente » Cod sursa (job #1108037) | Cod sursa (job #3175480) | Cod sursa (job #3174705) | Cod sursa (job #969310) | Cod sursa (job #1238254)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i,n,j,p,poz[100001],a[100001],best[100001],Max;
int main()
{
fin >>n;
for (i=1;i<=n;i++)
fin>>a[i];
best[n]=1;
poz[n]=-1;
p=n;
Max=1;
for (i=n-1;i>=1;i--)
{
best[i]=1;
poz[i]=-1;
for (j=i+1;j<=n;j++)
{
if (a[i]<a[j]&&best[i]<best[j]+1)
{
best[i]=best[j]+1;
poz[i]=j;
p=i;
if (Max<best[i])
Max=best[i];
}
}
}
i=p;
fout<<Max<<'\n';
while(i!=-1)
{
fout<<a[i]<<" ";
i=poz[i];
}
return 0;
}