Pagini recente » Cod sursa (job #2127373) | Cod sursa (job #1266196) | Cod sursa (job #613169) | Cod sursa (job #2322347) | Cod sursa (job #1325067)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
unsigned n,i,lmax,L[201],succ[201],l,j,x[201],prim;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>x[i];
L[n]=1; succ[n]=0;
for(i=n-1;i>=1;i--)
{
succ[i]=0;L[i]=1;
for(j=i+1;j<=n;j++)
if(x[j]>x[i])
if(L[j]>=L[i])
{
L[i]=L[j]+1;succ[i]=j;
}
if(lmax<L[i])
{
lmax=L[i];
prim=i;
}
}
//fout<<prim<<",,,";
fout<<lmax<<'\n';
for(i=prim,l=0;l<lmax;l++)
{
fout<<x[i]<<' ';
i=succ[i];
}
/*for(i=1;i<=n;i++)
fout<<L[i]<<" ";*/
return 0;
}