Pagini recente » Cod sursa (job #1501186) | Cod sursa (job #2813228) | Cod sursa (job #2259798) | Cod sursa (job #1712563) | Cod sursa (job #522418)
Cod sursa(job #522418)
#include <fstream>
using namespace std;
int im,lg[100001],urm[100001],i,j,n,v[100001];
int main()
{
int max;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
lg[n]=1;
urm[n]=0;
for (i=n-1;i>=1;i--)
{
max=0;
im=0;
for (j=i+1;j<=n;j++)
if(v[i]<v[j] && max<lg[j])
{
max=lg[j];
im=j;
}
lg[i]=max+1;
urm[i]=im;
}
max=lg[1];
im=1;
for (i=2;i<=n;i++)
if(max<lg[i])
{
max=lg[i];
im=i;
}
g<<max<<'\n';
do
{
g<<v[im]<<' ';
im=urm[im];
}
while (im!=0);
g.close();
return 0;
}