Pagini recente » Cod sursa (job #2377195) | Cod sursa (job #50761) | Cod sursa (job #2416829) | Cod sursa (job #151193) | Cod sursa (job #1613096)
#include <fstream>
using namespace std;
int v[100005],n,m,p,u[100005],l[100005],maxx;
int main()
{
int i,j,k=0;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
fin.close();
l[n]=1;
u[n]=n;
for (i=n-1;i>=1;i--)
{
for (j=i+1;j<=n;j++)
if (v[i]<v[j]&&l[i]<l[j])
{
l[i]=l[j]+1;
u[i]=j;
}
}
maxx=l[1];p=1;
for (i=2;i<=n;i++)
if (l[i]>maxx)
{
maxx=l[i];
p=i;
}
fout<<l[p]<<'\n';
for (i=p,j=1;j<=maxx;j++)
{
fout<<v[i]<<" ";
i=u[i];
}
fout.close();
return 0;
}