Pagini recente » Cod sursa (job #2710931) | Cod sursa (job #1118796) | Cod sursa (job #1261011) | Cod sursa (job #1025186) | Cod sursa (job #895271)
Cod sursa(job #895271)
#include <iostream>
#include <fstream>
using namespace std;
int n,x[100],l[100],ant[100];
ifstream in("scmax.in");
ofstream out("scmax.out");
void solutie (int p)
{
if(p>=0)
{
solutie(ant[p]);
out<<x[p]<<" ";
}
}
int main()
{
in>>n;
int i,lmax,a,p,j;
for(i=0;i<n;i++)
in>>x[i];
in.close();
for(i=0;i<n;i++)
{
lmax=0;a=-1;
for(j=0;j<i;j++)
if(x[i]>=x[j])
if(l[j]>lmax)
{lmax=l[j];a=j;}
l[i]=lmax+1;
ant[i]=a;
}
lmax=0;p=0;
for(i=0;i<n;i++)
if(l[i]>lmax){lmax=l[i];p=i;}
solutie(p);
out.close();
return 0;
}