Submission #24,255

2026-02-07 14:16:51

cpp17

Wrong answer 43/70

29ms

800 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin >> n;
    vector<int>tura(n);
    for (int i = 0;i < n;i++) cin >> tura[i];
    int cnt=0,longest = -1,size =1;
    for(int i = 1;i < n;i++){
        if(tura[i] != tura[i-1]){
            size++;
        }else{
            if(size > 1) cnt++;
            size = 1;
        }
        longest = max(longest,size);
    }
    cout <<cnt <<"\n"<< longest;
}

	Sum	Test	Verdict		Time	Memory
base	43/70
		1	Accepted	0/0	1ms	316 KiB
		2	Wrong answer	0/0	25ms	564 KiB
		3	Partially correct	2/3	1ms	316 KiB
		4	Partially correct	1/3	1ms	316 KiB
		5	Accepted	3/3	1ms	508 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Partially correct	2/3	1ms	404 KiB
		10	Partially correct	2/3	1ms	364 KiB
		11	Partially correct	2/3	1ms	316 KiB
		12	Partially correct	2/3	2ms	316 KiB
		13	Partially correct	2/4	2ms	316 KiB
		14	Partially correct	2/4	14ms	564 KiB
		15	Partially correct	2/4	17ms	652 KiB
		16	Partially correct	2/4	17ms	564 KiB
		17	Partially correct	2/4	18ms	664 KiB
		18	Partially correct	2/4	19ms	564 KiB
		19	Partially correct	2/4	27ms	564 KiB
		20	Partially correct	2/4	26ms	564 KiB
		21	Partially correct	2/4	29ms	800 KiB
		22	Partially correct	2/4	21ms	564 KiB