Pagini recente » Cod sursa (job #389199) | Cod sursa (job #350304) | Cod sursa (job #2536973) | Cod sursa (job #349922) | Cod sursa (job #1109523)
#include <iostream>
#include <fstream>
using namespace std;
int a[100001],l[100001],Max,pMax,n,lmax,pozmax,urm[100001];
int main()
{
int i,j;
ifstream in("scmax.in");
ofstream out("scmax.out");
in>>n;
for(i=1;i<=n;i++)
{
in>>a[i];
}
in.close();
l[n]=1;
for(i=n-1;i>0;i--)
{
Max=0;
pMax=0;
for(j=i+1;j<=n;j++)
{
if(l[j]>Max && a[i]<a[j])
{
Max=l[j];
pMax=j;
}
}
l[i]=1+Max;
urm[i]=pMax;
}
lmax=0;
pozmax=0;
for(i=1;i<=n;i++)
{
if(l[i]>lmax)
{
lmax=l[i];
pozmax=i;
}
}
while(pozmax!=0)
{
out<<a[pozmax]<<" ";
pozmax=urm[pozmax];
}
out.close();
return 0;
}