题目：一个序列有N个数：A[1],A[2],…,A[N]，求出最长非降子序列的长度。(见动态规划—LIS)
题目：一个序列有N个数：A[1],A[2],…,A[N]，求出最长非降子序列的长度。#include <stdio.h> 5 6 unsigned max_len( int [] , size_t ); 7 size_t b_point( int [] , size_t ); 8 int max(size_t , size_t );main( void )11 {arr[] = { 4 , 5 , 3 , 3 , 3 , 3 , 6 , 5 , 1 , 2 };, max_len( arr , sizeof arr / sizeof arr[0] ) ); ;18 }19 20 unsigned max_len( int a[] , size_t n )21 {22 if ( n <= 1u )23return n ; 2425 size_t m = b_point ( a , n ) ;max( m , max_len ( a + m , n – m ) ) ; 2829 }30 31 size_t b_point ( int a[] , size_t n )32 {33 size_t i ;( i = 1u ; i < n ; i++ )36if ( a[i-1] > a[i])37return i – 0u ;i – 0u ;40 } max( size_t n1 , size_t n2 )43 {44 if ( n1 > n2 )45return n1; n2;48 }，就是对虚怀若谷谦虚谨慎八个字真正理解的人，
