<![CDATA[The_sam的博客]]>https://blog.csdn.net/The_samzh-cnhttps://blog.csdn.net/<![CDATA[ACM 粗心永远AC不了系列——Demo Day|三维DP问题，机器人寻路，hiho一下第150周]]>https://blog.csdn.net/The_sam/article/details/72132966https://blog.csdn.net/The_sam/article/details/72132966The_samMon, 15 May 2017 13:13:36 +0800<![CDATA[算法导论——26.2 FordFulkerson方法，Edmonds-Karp算法java实现]]>https://blog.csdn.net/The_sam/article/details/71456465https://blog.csdn.net/The_sam/article/details/71456465The_samTue, 09 May 2017 14:23:35 +0800<![CDATA[算法导论——24.3 Dijkstra最短路径算法java实现]]>https://blog.csdn.net/The_sam/article/details/71438170https://blog.csdn.net/The_sam/article/details/71438170The_samTue, 09 May 2017 00:44:33 +0800<![CDATA[算法导论——24.2 DAG最短路径算法java实现]]>https://blog.csdn.net/The_sam/article/details/71437340https://blog.csdn.net/The_sam/article/details/71437340The_samMon, 08 May 2017 23:43:45 +0800<![CDATA[算法导论——24.1 BellmanFord算法java实现]]>https://blog.csdn.net/The_sam/article/details/71436297https://blog.csdn.net/The_sam/article/details/71436297The_samMon, 08 May 2017 21:43:11 +0800<![CDATA[ACM 粗心永远AC不了系列——小Hi的烦恼|“五维数点”问题]]>https://blog.csdn.net/The_sam/article/details/70982091https://blog.csdn.net/The_sam/article/details/70982091The_samSat, 29 Apr 2017 18:02:55 +0800<![CDATA[ACM 粗心永远AC不了系列——HDU 1754 I Hate It|线段树区间求最值]]>https://blog.csdn.net/The_sam/article/details/70948255https://blog.csdn.net/The_sam/article/details/70948255The_samSat, 29 Apr 2017 13:30:36 +0800<![CDATA[动态规划==》京东机2017实习生考题，通过概率]]>https://blog.csdn.net/The_sam/article/details/69661387https://blog.csdn.net/The_sam/article/details/69661387The_samFri, 07 Apr 2017 21:52:26 +0800<![CDATA[动态规划入门==》转换为DAG问题——钢条切割]]>https://blog.csdn.net/The_sam/article/details/69400589https://blog.csdn.net/The_sam/article/details/69400589The_samThu, 06 Apr 2017 18:38:41 +0800j  则i可以指向j，代价为上图（i-j）对应数值，结果就是求最长路径。 2.问题小化，即求出前]]><![CDATA[动态规划入门==》转换为DAG问题——最短路径|矩阵嵌套|硬币问题]]>https://blog.csdn.net/The_sam/article/details/68492011https://blog.csdn.net/The_sam/article/details/68492011The_samThu, 30 Mar 2017 19:31:44 +0800E的最短路径。 这个问题]]><![CDATA[算法导论——16.1-5动态规划解决活动选择带值问题]]>https://blog.csdn.net/The_sam/article/details/67645762https://blog.csdn.net/The_sam/article/details/67645762The_samTue, 28 Mar 2017 20:54:01 +0800<![CDATA[盛大游戏面试题目小结]]>https://blog.csdn.net/The_sam/article/details/66991217https://blog.csdn.net/The_sam/article/details/66991217The_samMon, 27 Mar 2017 23:17:40 +0800<![CDATA[三次握手与四次挥手示意图]]>https://blog.csdn.net/The_sam/article/details/65445286https://blog.csdn.net/The_sam/article/details/65445286The_samThu, 23 Mar 2017 16:34:58 +0800<![CDATA[ACM 粗心永远AC不了系列——UVA 512 - Spreadsheet Tracking 追踪电子表格中的单元格 |变换思想的另一种思路]]>https://blog.csdn.net/The_sam/article/details/61920961https://blog.csdn.net/The_sam/article/details/61920961The_samMon, 13 Mar 2017 16:41:45 +0800<![CDATA[ACM 粗心永远AC不了系列——UVa 213 Message Decoding(World Finals1991，字符串) |二维数组的妙用]]>https://blog.csdn.net/The_sam/article/details/61916527https://blog.csdn.net/The_sam/article/details/61916527The_samMon, 13 Mar 2017 13:55:21 +0800<![CDATA[《μCOS-III源码分析笔记》学习笔记|2|第三章时间管理]]>https://blog.csdn.net/The_sam/article/details/61421125https://blog.csdn.net/The_sam/article/details/61421125The_samSat, 11 Mar 2017 21:18:41 +0800<![CDATA[《μCOS-III源码分析笔记》学习笔记|1|第二章时钟节拍]]>https://blog.csdn.net/The_sam/article/details/61419728https://blog.csdn.net/The_sam/article/details/61419728The_samSat, 11 Mar 2017 16:11:03 +0800<![CDATA[ACM 粗心永远AC不了系列——HDU 1097 A hard puzzle]]>https://blog.csdn.net/The_sam/article/details/59559193https://blog.csdn.net/The_sam/article/details/59559193The_samThu, 02 Mar 2017 17:09:24 +0800