摘要：
Warning: input could be > 10000...Solution by segment tree:struct Node{ Node(int s, int e) : start(s), end(e), cnt(0), left(nullptr), right(nullptr... 阅读全文
posted @ 2015-10-13 13:57
Tonix
阅读(156)
评论(0)
推荐(0)
摘要：
Same as LintCode 'Coins in a line'. Here is mind-flow: 4 is a definite lose, for (4 + 1), (4 + 2), (4 + 3), we can put the other player into slot 4 - ... 阅读全文
posted @ 2015-10-13 05:34
Tonix
阅读(184)
评论(0)
推荐(0)
浙公网安备 33010602011771号