qeatzy的博客

partial sort, nth_element, stable_partition, lambda expression

(C++, 0ms, explanatory comments.) plus a nice solution from acmerblog

bit masking, utilization of switch, '\0' as end of c string

hdu 1231, maximum consecutive sum of integers, finding the boundaries, possibly all negative, C++

hdu 1082, stack emulation, and how to remove redundancy

disjoint set, linked list version with weighted-union heuristic, rooted tree version with rank by union and path compression, and a minor but substantial optimization for path compression version FindSet.

Rabin-Karp and Knuth-Morris-Pratt Algorithms

multiple-choice knapsack

a typical variant of LCS algo. the key point here is, the dp[][] array contains enough message to determine the LCS, not only the length, but all of LCS candidates, we can backtrack to find all of LCS.

one recursive approach to solve hdu 1016 , list all permutations, solve N-Queens puzzle. reference: the video of stanford cs106b lecture 10 by Julie Zelenski https://www.youtube.com/watch?v=NdF1QDTRkck

hdu 1159, LCS, dynamic programming, recursive backtrack vs iterative backtrack vs incremental, C++

use sentinel to avoid boudary testing, use swap trick to avoid extra copy.

(greedy algorithm, how a little modification turn 15ms to 0ms)

make your selection based on what you need to accomplish, not on performance considerations.

(preprocess optimization, use floor property of division to avoid if)

(OO approach, private constructor to prevent instantiation)

(string process, fgets, scanf, neat utilization of switch clause)

(I/O routines, fgets, sscanf, %02d, rounding, atoi, strtol)

design of func

(greedy algorithm)

huffman coding, greedy algorithm.

(preinitilization or postcleansing, std::fill)

leetcode N-Queens/N-Queens II, backtracking, hdu 2553 count N-Queens, dfs