Pagini recente » Cod sursa (job #2830302) | Cod sursa (job #12461) | Cod sursa (job #1736205) | Cod sursa (job #296465) | Cod sursa (job #405640)
Cod sursa(job #405640)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,lm,p,l[100],a[100];
void dinamica()
{
int i,j,m;
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()
{
int t=0;
p=1;
do
{
while ( l[p]!=lm || a[t]>a[p] )
p++;
g<<a[p]<<' ';
t=p;
lm--;
}
while ( lm );
}
int main()
{
f>>n;
for ( i=1; i<=n; i++ )
f>>a[i];
dinamica();
drum();
return 0;
}