BerSU

B. BerSU Ball 排序后考虑\(dp\),\(dp_{i,j}\)表示前\(i\)个男生和前\(j\)个女生能匹配的最大数. \[\begin{aligned} if(|a_i - b_j| \le 1) \ dp_{i,j} = dp_{i-1,j-1} + 1 \\ else \ \ ......

[原题](https://codeforces.com/problemset/problem/489/B) #### 解决思路 排序+双指针 ```C++ #include int main() { int n; std::cin >> n; std::vector a(n + 1, 0); for ......