hdu 4687 Boke and Tsukkomi
摘要:
Dancing link twice.Find the maximum combination numbers in the first time.Enumerate each node, dancing.If the new result is not optimaze, then push it into ans.#include #include #include #include #include #include using namespace std;const int M = 200;// exactstruct dancing {#define dfor(c, a, b) fo 阅读全文
浙公网安备 33010602011771号