30求调,必关
查看原帖
30求调,必关
1630835
meng17801182280楼主2025/7/31 13:38
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, a, b, cf[1000005] = {}, aa[1000005] = {}, maxn = -1;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a >> b;
        cf[a]++;
        cf[b + 1]--;
    }
    for (int i = 1; i < n; i++){
        aa[i] = aa[i - 1] + cf[i];
        maxn = max(maxn, aa[i]);
    } 
    maxn = max(maxn, aa[0]);
    cout << maxn;
    return 0 ;
}
2025/7/31 13:38
加载中...