Pagini recente » Cod sursa (job #2472379) | Cod sursa (job #258468) | Cod sursa (job #3005576) | Cod sursa (job #1783749) | Cod sursa (job #403804)
Cod sursa(job #403804)
#include<cstdio>
using namespace std;
int n,v[1000],i,k,L[1000],mx,max,t;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&v[i]);
L[n]=1;
for(k=n-1;k>=1;k--)
{
mx=0;
for(i=k+1;i<=n;i++)
if(v[k]<=v[i] && L[i]>mx)
mx=L[i];
L[k]=mx+1;
if(L[k]>max)
{
max=L[k];
t=k;
}
}
printf("max=%d\n",max);
printf("%d ",v[t]);
for(i=t+1;i<=n;i++)
if ( (v[i]>=v[t]) && (L[i]==max-1) )
{
printf("%d ",v[i]);
max--;
}
return 0;
}