資源簡介
一些動態規劃,最新最典型的算法!如,背包問題,鋼管切割問題,最長子序列問題等等。

代碼片段和文件信息
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????2095442??2012-04-26?11:31??DP?PPT\Chapter_15_Dynamic_Programming_Part_1.pdf
?????文件????2711179??2012-05-04?22:52??DP?PPT\Chapter_15_Dynamic_Programming_Part_2.pdf
?????文件????1654535??2012-04-26?11:33??DP?PPT\Chapter_15_Dynamic_Programming_Part_3.pdf
?????目錄??????????0??2012-04-26?11:33??DP?PPT
-----------?---------??----------?-----??----
??????????????6461156????????????????????4
-----------?---------??----------?-----??----
?????文件????2095442??2012-04-26?11:31??DP?PPT\Chapter_15_Dynamic_Programming_Part_1.pdf
?????文件????2711179??2012-05-04?22:52??DP?PPT\Chapter_15_Dynamic_Programming_Part_2.pdf
?????文件????1654535??2012-04-26?11:33??DP?PPT\Chapter_15_Dynamic_Programming_Part_3.pdf
?????目錄??????????0??2012-04-26?11:33??DP?PPT
-----------?---------??----------?-----??----
??????????????6461156????????????????????4
評論
共有 條評論