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.See you again.Today i want to show you the algorithm of network flow based on DFS.It is easy,and next i will show you the other ways to solve the network flow problem.Have fun coding,

Hello,everyone,see you again.Yesterday I showed you the single source shortest path,and today I want to show you the Kruskal based on greedy algorithm.The difficulity of this solution is how to judge

The single source shortest path problem is a typical problem.And I give a solution based on Dijkstra,which is as follow.

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

In my opinion,this way of Bellman Ford is not the solution based on dynamic programming.Because it lists all the situation,which is a waste of time,no from bottom to top,and no Memorandum.So i will gi

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

昨天给出了蹩脚的Bellman-Ford动态规划实现，今天给出一种更快的算法，SPFA。在编程过程中遇到了两个问题：1.没有充分考虑数组指向；2.没有充分考虑递归过程中的条件制约。希望大家可以帮忙看一下上一篇博客，解决一下那个问题。如果可以改进该算法，请各位大神不吝赐教。Have fun coding,i_human.Have fun coding ,everyone!TH

it is really a shame that today i can not write my own artical.i will try harder.good night,everyone!

Hello,everyone!See you again.Today i want to show you an important method----quicksort. It is a useful to sort,because it waste less time than many other sort ways.

Hello,everyone.Yesterday is Mid-Autumn Festival.And i am so sorry that i waste my time on computer games.But today i come back and keep fighting,which is my responsibility.And today i am here to  solv

Good morning.everyone.Yesterday i said today i will give you some harder problems solved by divide and conquer.And here it is,The Board covering problem.The code is wrote by myself,and it is not simpl

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

Hello,everyone.Long time no meeting.Graph theory is a little difficult for me.Because the code is difficult to write.And i have not learned STL yet.So i spend so time to find my own data structure,and