[二分图][Hall定理][线段树] ARC076 F - Exhausted?

$Solution$

根据Hall定理答案就是

$$\text{MAX}_{S\subseteq U}(|N(S)|-|S|)$$ 设一个点对 $(s,t)$代表区间 $[1,s]\cup[t,m]$。那么如果这个作为 $N(S)$，就有 $L_i\le s,R_i\ge t,i\in S$。
把这些点放在平面内就相当于数点。一个点会对其右下方的点有影响。
扫描线+线段树。

#include <bits/stdc++.h>
using namespace std;

const int N = 202020;
typedef pair<int, int> Pairs;

inline char get(void) {
  static char buf[100000], *S = buf, *T = buf;
  if (S == T) {
    T = (S = buf) + fread(buf, 1, 100000, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
template<typename T>
inline void read(T &x) {
  static char c; x = 0; int sgn = 0;
  for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
  for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
  if (sgn) x = -x;
}

Pairs p[N];
int n, m, ans;
int S[N << 2], T[N << 2];

inline void PushUp(int o) {
  S[o] = S[o << 1] + S[o << 1 | 1];
  T[o] = max(T[o << 1], S[o << 1] + T[o << 1 | 1]);
}
void Build(int o, int l, int r) {
  if (l == r) {
    S[o] = l == 0 ? 0 : -1;
    T[o] = 0; return;
  }
  int mid = l + r >> 1;
  Build(o << 1, l, mid);
  Build(o << 1 | 1, mid + 1, r);
  PushUp(o);
}
void Add(int pos, int w) {
  int o = 1, l = 0, r = m;
  while (l < r) {
    int mid = l + r >> 1;
    if (pos <= mid) {
      o = o << 1; r = mid;
    } else {
      o = o << 1 | 1; l = mid + 1;
    }
  }
  T[o] = max(0, S[o] += w);
  while (o >>= 1) PushUp(o);
}

int main(void) {
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  read(n); read(m);
  for (int i = 1; i <= n; i++) {
    read(p[i].first); read(p[i].second);
    p[i].second = m + 1 - p[i].second;
  }
  sort(p + 1, p + n + 1);
  Build(1, 0, m);
  for (int i = 1; i <= n; i++) {
    Add(p[i].second, 1);
    ans = max(ans, T[1] - p[i].first);
  }
  printf("%d\n", max(ans, n - m));
  return 0;
}