BZOJ3524: [Poi2014]Couriers
摘要:
题目:http://www.lydsy.com/JudgeOnline/problem.php?id=3524可持久化线段树。连离散化都不用。找一个出现次数最大的数那就比较是左儿子大还是右儿子大找下去就可以了。#include#include#include#include#define rep(i... 阅读全文
posted @ 2015-12-21 20:15 ctlchild 阅读(1988) 评论(0) 推荐(0) 编辑