摘要: 原题:http://www.caioj.cn/problem.php?id=1246题解:本题要查询前驱,即比x小的最大值。考虑分块,对每个块排序,二分查找x,维护个最大值。#include#include#include#include#include#define... 阅读全文
posted @ 2019-01-08 22:20 Exception2017 阅读(163) 评论(0) 推荐(0) 编辑