Pagini recente » Cod sursa (job #1007743) | Cod sursa (job #1764010) | Cod sursa (job #326645) | Cod sursa (job #483218) | Cod sursa (job #415392)
Cod sursa(job #415392)
#include <stdio.h>
#define NMAX 5005
#define INF 100000
int n,A[NMAX],B[NMAX],C[NMAX],rez=INF;
void read()
{
scanf("%d",&n);
int i;
for (i=1; i<=n; i++)
scanf("%d",&A[i]);
}
inline int max(int a,int b)
{
return a>b ? a : b;
}
void solve()
{
int i,j;
for (i=1; i<=n; i++)
{
for (j=1; j<i; j++)
if (A[j]<A[i])
B[i]=max(B[i],B[j]);
B[i]++;
}
for (i=n; i>=1; i--)
{
for (j=i+1; j<=n; j++)
if (A[j]>A[i])
C[i]=max(C[i],C[j]);
C[i]++;
}
}
void show()
{
int i;
for (i=1; i<=n; i++)
if (B[i]+C[i]<rez)
rez=B[i]+C[i]-1;
printf("%d\n",rez);
for (i=1; i<=rez; i++)
printf("%d ",A[i]);
printf("\n");
}
int main()
{
freopen("subsir2.in","r",stdin);
freopen("subsir2.out","w",stdout);
read();
solve();
show();
return 0;
}