qeatzy

摘要： IMO, version 1 better than version 2, version 2 better than version 3. make some preprocess to make you code simple and efficient. Here divide... 阅读全文

摘要： as Scott Meyers said in his book Effective STL, “My advice on choosing among the sorting algorithms is to make your selection based on what y... 阅读全文

摘要： bit masking is very common on the lower level code.#include #include #define MAXSIZE 205char line[MAXSIZE];int main() { //freopen("input.tx... 阅读全文

摘要： partial sort. first use std::nth_element to find pivot, then use std::stable_partition with the pivot to partition the largest k, whose indice... 阅读全文

摘要： problem description http://acm.hdu.edu.cn/showproblem.php?pid=1030#include #include #include int calPathLength(int x, int y) { //path lengt... 阅读全文