Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #415943)
Utilizator | Data | 11 martie 2010 23:30:33 | |
---|---|---|---|
Problema | Subsir 2 | Scor | 22 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <stdio.h>
#define NMAX 5005
#define INF 2000000000
int n,A[NMAX],B[NMAX],rez;
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];
for (j=i+1; j<=n; j++)
if (A[j]==m)
B[i]=min(B[i],B[j]);
if (B[i]==INF)
B[i]=1;
else
B[i]++;
}
}
void show()
{
int i;
for (i=1; i<=n; i++)
if (B[i]>rez)
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;
}