Pagini recente » Cod sursa (job #1661179) | Cod sursa (job #375141) | Cod sursa (job #133795) | Cod sursa (job #1475295) | Cod sursa (job #1892317)
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i,j,n,a[100001],best[100001],poz,maxim,p,pre[100001];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
best[n]=1;
pre[n]=-1;
for(i=n-1;i>=1;i--)
{
best[i]=1;
pre[i]=-1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j] && best[i]<best[j]+1)
{
best[i]=best[j]+1;
pre[i]=j;
if(best[i]>maxim)
{
maxim=best[i];
p=i;
}
}
}
fout<<maxim<<'\n';
i=p;
while(i!=-1)
{
fout<<a[i]<<' ';
i=pre[i];
}
return 0;
}