Pagini recente » Cod sursa (job #1358140) | Cod sursa (job #2613371) | Cod sursa (job #2133672) | Cod sursa (job #2614428) | Cod sursa (job #2108811)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[100000],best[100000],poz[100000],maxim,pz;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
void citire()
{
for(int i=1;i<=n;i++)
fin>>a[i];
}
void prep()
{
int i,j;
best[n]=1;
poz[n]=-1;
maxim=1;
pz=n;
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;
if(best[i]>maxim)
{
maxim=best[i];
pz=i;
}
break;
}
}
}
void afis()
{
int i;
i=pz;
while(i!=-1)
{
fout<<a[i]<<' ';
i=poz[i];
}
}
int main()
{
fin>>n;
citire();
prep();
fout<<maxim<<'\n';
afis();
return 0;
}