Pagini recente » Cod sursa (job #1816336) | Cod sursa (job #1092058)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100001],urm[100001],l[100001];
int main()
{
int n,p,max=0,i,j;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
urm[n]=0;
for(i=n-1;i>0;--i)
{
max=0;
p=0;
for(j=i+1;j<=n;++j)
if(v[j]>v[i] && l[j]>max)
{
max=l[j];
p=j;
}
l[i]=max+1;
urm[i]=p;
}
max=l[1];
p=1;
for(i=2;i<=n;i++)
if(l[i]>max)
{
max=l[i];
p=i;
}
g<<max<<"\n";
while(p>0)
{
g<<v[p]<<" ";
p=urm[p];
}
f.close();
g.close();
return 0;
}