Tony's Log

摘要： A typical flood-fill algorithm application (BFS). Not very complex, except only 1 tip: instead of searching for new space, I keep all spaces(occupied or not) in a hash_map that gets updated in a flood-fill.#include #include #include #include #include #include #include #include using namespace std;#i 阅读全文

摘要： The default answer to LCS(consecutive or non-consecutive) is DP. Recurrence formula can be found athttp://en.wikipedia.org/wiki/Longest_common_subsequence_problem . Calculation is O(mn) and printing is O(m+n).But this typical DP algorithm triggers TLE, as many others:#include #include #include #incl 阅读全文