152582025-02-17 18:17:02TakacsAndrasLeghosszabb 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> a(n+2);
    for (int i = 0; i < m; i++) {
        int x1,x2; cin >> x1 >> x2;
        a[x1]++;
        a[x2+1]--;
    }
    int sm = 0, cnt = 0, out1 = 0, out2 = 0;
    for (int i = 1; i <= n; i++) {
        sm += a[i];
        if (sm == 0) {
            cnt++;
            if (cnt > out1) {
                out1 = cnt;
                out2 = i-cnt+1;
            }
        }
        else cnt = 0;
    }
    if (out1 == 0) cout << -1;
    else cout << out1 << ' ' << out2;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/064ms572 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms500 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms352 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/44ms316 KiB
12Accepted4/46ms472 KiB
13Accepted4/44ms316 KiB
14Accepted4/44ms468 KiB
15Accepted4/46ms336 KiB
16Accepted4/46ms316 KiB
17Accepted4/46ms576 KiB
18Accepted4/47ms564 KiB
19Accepted4/457ms804 KiB
20Accepted4/459ms564 KiB
21Accepted4/454ms564 KiB
22Accepted4/457ms728 KiB