文件名称:539156
介绍说明－－下载内容均来自于网络，请自行研究使用
本问题是计算最长有序子序列的一个动态规划算法,效率为31MS()
相关搜索： 大数据
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| O10001.c | 469 | 2007-09-15 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.cpp | 0 | 2007-09-15 |
| 动态规划算法\Longest Ordered Subsequence\Longest Ordered Subsequence.cpp1.cpp | 475 | 2007-09-16 |
| 动态规划算法\Longest Ordered Subsequence\Longest Ordered Subsequence2.cpp | 482 | 2007-09-16 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.dsp | 3715 | 2007-09-14 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.dsw | 572 | 2007-09-14 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.ncb | 33792 | 2007-09-14 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.opt | 48640 | 2007-09-14 |
| F10001Longest Ordered Subsequence\10001Longest Ordered Subsequence.plg | 798 | 2007-09-14 |
| F10001Longest Ordered Subsequence\LongestOrderedSubsequence.rar | 99 | 2007-09-17 |
| F10001Longest Ordered Subsequence\Debug | 0 | 2007-09-14 |
| 动态规划算法\Longest Ordered Subsequence | 0 | 2017-12-01 |
| F10001Longest Ordered Subsequence | 0 | 2017-12-01 |
| 动态规划算法 | 0 | 2017-12-01 |