i_human的博客

Hello,everyone.I said i will spend three days to learn the dynamic programming.And today is the first day.I will show two simple problems solved by dynamic programming.And there is on doubt that if yo

Hello,everyone.Today i want to show you the 0-1 Knapsack problem,which is based on dynamic programming.Although i can solve this problem,but i still do not  have a good command at the dynamic programm

思考这个算法已经两天了。之前发过一个Bellman-Ford算法，但那一个使用的是收缩法，十分耗费时间。于是开始尝试动态规划，代码如下，已经可以解决有负值时的求解最短路径，但是没有处理负圈的功能。因为我没有能力在动态规划的递归函数中进行负圈的判断（个人感觉Algorithm design 中“n-1!=n"一说有误）。如果在递归外部判断，那么该方法就失去了相对于收缩法的优势，时间复杂度将相等。

Hello,everyone. Today is the second day,and i am fighting.You must know that dynamic programming is a flexible problem.And there is a ad problem.You want to make ad walls on a street to earn money.But