146382025-01-22 19:40:13miszorimarciLeghosszabb béke (75 pont)cpp17Accepted 75/7564ms804 KiB
#include <bits/stdc++.h>
using namespace std;


int main() {
    int n, m;
    cin >> n >> m;
    vector<int> T(n+2);
    T[n+1] = 1;
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        T[x]++;
        T[y+1]--;
    }

    int cnt = 0, mx = 0, temp = 1;
    int ans;

    for(int i = 1; i <= n+1; i++) {
        T[i]+=T[i-1];
        if(T[i] == 0) {
            cnt++;
        } else {
            if (cnt > mx) {
                mx = cnt;
                ans = temp;
            }
            temp = i+1;
            cnt = 0;
        }
    }
    if (mx == 0) {
        cout << -1 << endl;
        return 0;
    }
    cout << mx << " " << ans << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/064ms564 KiB
3Accepted3/31ms508 KiB
4Accepted3/31ms500 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/44ms316 KiB
12Accepted4/46ms384 KiB
13Accepted4/44ms316 KiB
14Accepted4/44ms316 KiB
15Accepted4/46ms464 KiB
16Accepted4/46ms316 KiB
17Accepted4/46ms568 KiB
18Accepted4/47ms604 KiB
19Accepted4/457ms804 KiB
20Accepted4/457ms804 KiB
21Accepted4/456ms800 KiB
22Accepted4/457ms804 KiB