255612026-02-20 18:15:13mihalykocsisÉrdekes túra (70 pont)cpp17Accepted 70/7028ms800 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	int count = 1;
	int ans = 0;
	int maxi = -1;
	for (int i = 0; i < n - 1; i++) {
		if (v[i] != v[i + 1]) {
			count++;
		} else {
			if (count >= 2) {
				if (maxi < count) {
					maxi = count;
				}
				ans++;
			}
			count = 1;
		}
	}
	if (count >= 2) {
		ans++;
		maxi = max(maxi, count);
	}
	cout << ans << "\n" << maxi;
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms316 KiB
2Accepted0/024ms756 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/32ms316 KiB
8Accepted3/32ms500 KiB
9Accepted3/32ms548 KiB
10Accepted3/32ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/32ms500 KiB
13Accepted4/42ms612 KiB
14Accepted4/414ms564 KiB
15Accepted4/417ms640 KiB
16Accepted4/417ms564 KiB
17Accepted4/418ms564 KiB
18Accepted4/418ms728 KiB
19Accepted4/425ms564 KiB
20Accepted4/424ms564 KiB
21Accepted4/428ms800 KiB
22Accepted4/420ms756 KiB