2019年10月11日
G - Multidimensional Queries 线段树结合状压
摘要： 题意 给出一个k维度空间，求[l,r]的最大曼哈顿距离。 用二进制枚举绝对值相加可能出现的所有情况。用线段树来维护单点修改，区间查询。 cpp include include include include include include include include include includ 阅读全文
posted @ 2019-10-11 20:15 LORDXX 阅读(91) 评论(0) 推荐(0) 编辑