2018年4月1日
POJ 1741 Tree
摘要： 点分治 非常巧妙的实现, 复杂度 O(n log ^2 n) https://www.cnblogs.com/GXZlegend/p/6641720.html cpp include include include include include include using namespace st 阅读全文
posted @ 2018-04-01 16:44 Mr_Wolfram 阅读(102) 评论(0) 推荐(0) 编辑