学步园

伪代码：

input:Num[n]  
  Max[1..n]=1  
  for   i<-2   to   n  
      for   j<-1   to   i-1  
          if   Num[i]<Num[j]   and   Max[i]<=Max[j]   then   Max[i]<-Max[j]+1  
  Output(Maxam(Max[1..n]))   
 状态转移方程：max[i]=max{max[j]}+1,j<i;

#include <stdio.h><br /> main()<br /> {<br /> int a[11], s[11], m[11];<br /> int i, j, max;<br /> for (i = 1; i <= 10; i++) {<br /> printf("input number a[%d]:/n", i);<br /> scanf("%d", &a[i]);<br /> m[i] = 1;<br /> s[i] = -1;<br /> }<br /> m[1] = 1;<br /> for (i = 1; i <= 10; i++)<br /> for (j = 1; j < i; j++)<br /> if (a[j] <= a[i] && m[j] + 1 > m[i] ) {<br /> m[i] = m[j] + 1;<br /> s[i] = j;<br /> }<br /> max = 1;<br /> for (i = 1; i <= 10; i++)<br /> // printf("%d/t", m[i]);<br /> if (m[i] > m[max])<br /> max = i;<br /> i = max;<br /> // printf("%d/n", i);<br /> while (s[i] != -1) {<br /> printf("%d/t", a[i]);<br /> i = s[i];<br /> }<br /> printf("%d", a[i]);<br /> }