Pagini recente » Cod sursa (job #1490964) | Cod sursa (job #2005000) | Cod sursa (job #1069487) | Cod sursa (job #3191380) | Cod sursa (job #415947)
Cod sursa(job #415947)
#include <stdio.h>
#define NMAX 5005
#define INF 2000000000
int n,A[NMAX],B[NMAX],rez=INF;
void read()
{
scanf("%d",&n);
int i;
for (i=1; i<=n; i++)
scanf("%d",&A[i]);
}
inline int min(int a,int b)
{
return a<b ? a : b;
}
void solve()
{
int i,j,m;
for (i=n; i>=1; i--)
{
m=INF;
B[i]=INF;
for (j=i+1; j<=n; j++)
if (A[j]>A[i] && A[j]<m)
{
m=A[j];
B[i]=B[j];
}
if (B[i]==INF)
B[i]=1;
else
B[i]++;
}
}
void show()
{
int i,m=INF;
for (i=1; i<=n; i++)
{
m=min(m,A[i]);
if (A[i]==m)
rez=min(rez,B[i]);
}
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;
}