摘要:
2026/3/28 16:14 二分中位数的模板如下: bool check1(long long x) { long long cnt1 = 0, cnt2 = 0; for (long long i = 1; i <= n; i++) { if (a[i].l2 > x) cnt2 += a[i 阅读全文
posted @ 2026-03-28 16:54
liuyc0120
阅读(1)
评论(0)
推荐(0)
摘要:
离散化二分的时候一定要看清楚总数啊!!! lower_bound(b + 1, b + 1 + len, a[i])√ lower_bound(b + 1, b + 1 + n, a[i])× 阅读全文
posted @ 2026-03-28 16:36
liuyc0120
阅读(1)
评论(0)
推荐(0)

浙公网安备 33010602011771号