248052026-02-15 18:32:36sarminÉrdekes túra (70 pont)cpp17Partially correct 68/7012ms824 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    int db = 0, mx = 0, st = 0;
    bool van = 0;
    for (int i = 0; i < n; i++) {
    	cin >> a[i];
    	if (a[i] != a[i-1]) van = true;
    	if (a[i] == a[i-1]) {
    		mx = max(mx, i-st);
    		if (i-st != 1) db++;
    		st = i;
    	}
    }
    mx = max(mx, (n-1)-st);
    if ((n-1)-st != 0) db++;
    
    if (!van || mx == 1) {
    	cout << "0\n-1" << "\n";
    } else {
    	cout << db << "\n" << mx << "\n";
    }
	

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base68/70
1Accepted0/01ms316 KiB
2Accepted0/09ms824 KiB
3Partially correct1/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms392 KiB
13Accepted4/41ms500 KiB
14Accepted4/46ms564 KiB
15Accepted4/47ms564 KiB
16Accepted4/47ms564 KiB
17Accepted4/47ms564 KiB
18Accepted4/48ms612 KiB
19Accepted4/49ms564 KiB
20Accepted4/49ms820 KiB
21Accepted4/412ms588 KiB
22Accepted4/48ms564 KiB