LongestIncreasingSequence

代码说明：

  找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)

文件列表：

LongestIncreasingSequence
.........................\Debug
.........................\.....\LongestIncreasingSequence.exe,40448,2009-09-03
.........................\.....\LongestIncreasingSequence.ilk,382448,2009-09-03
.........................\.....\LongestIncreasingSequence.pdb,576512,2009-09-03
.........................\LongestIncreasingSequence
.........................\.........................\Debug
.........................\.........................\.....\BuildLog.htm,12230,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.embed.manifest,663,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.embed.manifest.res,728,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.intermediate.manifest,621,2009-09-03
.........................\.........................\.....\main.obj,40073,2009-09-03
.........................\.........................\.....\mt.dep,69,2009-09-03
.........................\.........................\.....\vc90.idb,166912,2009-09-03
.........................\.........................\.....\vc90.pdb,208896,2009-09-03
.........................\.........................\LongestIncreasingSequence.vcproj,3970,2009-09-03
.........................\.........................\LongestIncreasingSequence.vcproj.REMUX.remex.user,1407,2009-09-03
.........................\.........................\main.cpp,1028,2009-09-03
.........................\LongestIncreasingSequence.ncb,1166336,2009-09-03
.........................\LongestIncreasingSequence.sln,941,2009-09-03