文件名称:Longest common subsequence
介绍说明－－下载内容均来自于网络，请自行研究使用
用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it with different data volume.)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| Longest common subsequence\子序列.cpp | 2524 | 2017-12-04 |
| Longest common subsequence\活动.cpp | 1688 | 2017-12-04 |
| Longest common subsequence | 0 | 2018-03-27 |