第一题离散化+差分,比较正常 #include <bits/stdc++.h> using namespace std; using LL = long long; const int maxn = 200200; int n; int x[maxn], y[maxn]; int h[maxn << 1], hcnt; int f[maxn << 1]; int id(int x) { return lower_bound(h, h + hcnt, x) - h + 1; } signed main() { // freopen(&quo...