Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

2015年8月2日

摘要: No big difference with "Breadth First Search: Shortest Reach", but this statement is crucial:If there are edges between the same pair of nodes with di... 阅读全文
posted @ 2015-08-02 15:18 Tonix 阅读(1179) 评论(0) 推荐(0)

摘要: Typical Dijstra algorithm impl. one.#include #include #include #include #include #include #include #include #include using namespace std;const long DI... 阅读全文
posted @ 2015-08-02 14:43 Tonix 阅读(1196) 评论(0) 推荐(0)

摘要: A combination of different DP passes.https://www.hackerrank.com/challenges/lego-blocks/editorial#include #include #include using namespace std;typedef... 阅读全文
posted @ 2015-08-02 05:31 Tonix 阅读(869) 评论(0) 推荐(0)