Pagini recente » Cod sursa (job #2439391) | Cod sursa (job #1029685) | Cod sursa (job #2572228) | Cod sursa (job #57141) | Cod sursa (job #407607)
Cod sursa(job #407607)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long n,lm,p,l[100],a[100];
int i,j,m,t;
void citeste()
{
f>>n;
for ( i=1; i<=n; i++ )
f>>a[i];
}
void dinamica()
{
l[n]=1;
for ( i=n-1; i>=1; i-- )
{
m=0;
for ( j=i+1; j<=n; j++ )
if ( l[j]>=m && a[i]<=a[j] )
m=l[j];
l[i]=m+1;
if ( lm<l[i] )
lm=l[i];
}
}
void drum()
{
p=1;
do
{
while ( l[p]!=lm || a[t]>a[p] )
p++;
g<<a[p]<<' ';
t=p;
lm--;
}
while ( lm );
}
int main()
{
citeste();
dinamica();
drum();
return 0;
}