Problem B:Longest Ordered Subsequence
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標(biāo)簽：
Subsequence
sequence
Problem
Longest
上傳時間：
2016-12-08
上傳用戶：busterman
the book provides many solved examples that illustrate the principles involved,
and includes, in addition, two chapters that deal exclusively with applications of
unconstrained and constrained optimization methods to problems in the areas of
pattern recognition, control systems, robotics, communication systems, and the
design of digital filters. For each application, enough background information
is provided to promote the understanding of the optimization algorithms used
to obtain the desired solutions.
標(biāo)簽：
illustrate
principles
the
provides
上傳時間：
2014-01-20
上傳用戶：woshiayin
