Submission #25,560

2026-02-20 18:10:43

cpp17

Partially correct 68/70

29ms

756 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++;
	}
	cout << ans << "\n" << maxi;
}

	Sum	Test	Verdict		Time	Memory
base	68/70
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	26ms	564 KiB
		3	Partially correct	1/3	2ms	508 KiB
		4	Accepted	3/3	2ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	508 KiB
		8	Accepted	3/3	1ms	508 KiB
		9	Accepted	3/3	2ms	560 KiB
		10	Accepted	3/3	2ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	3/3	2ms	316 KiB
		13	Accepted	4/4	2ms	316 KiB
		14	Accepted	4/4	14ms	564 KiB
		15	Accepted	4/4	17ms	640 KiB
		16	Accepted	4/4	17ms	748 KiB
		17	Accepted	4/4	18ms	564 KiB
		18	Accepted	4/4	20ms	748 KiB
		19	Accepted	4/4	27ms	564 KiB
		20	Accepted	4/4	26ms	564 KiB
		21	Accepted	4/4	29ms	564 KiB
		22	Accepted	4/4	23ms	756 KiB