Submission

Score: 100

User: boommmmm

Problemset: ลอดสะพาน

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-17 23:07:49

#include<bits/stdc++.h>
using namespace std;
int main() {
    int l,n;
    cin >> l >> n;
    vector<pair<int,int>> bridges(n);
    for (int i=0;i<n;i++) {
        cin >> bridges[i].first >> bridges[i].second;
    }
    int maxc=0;
    for (int i=1;i<l*2;i++) {
        double pos=i*0.5;
        int c=0;
        for (int j=0;j<n;j++){
            if(bridges[j].first<pos && pos<bridges[j].second) {
                c++;
            }
        }
        maxc=max(maxc,c);
    }
    cout << maxc << "\n";
    return 0;
}