Submission #25,587

2026-02-20 20:35:59

cpp17

Partially correct 67/70

28ms

756 KiB

// Source: https://usaco.guide/general/io

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

int main() {
    int n;
    cin >> n;
    vector<int>t(n+1);
    for(int i=1; i<=n; i++){
        cin >> t[i];
    }
    int l=1;
    int maxi=-1;
    int db=0;
    for(int r=2; r<=n; r++){
        if(t[r-1]==t[r]){if(r-l>2){db++;} l=r; }
        //cout << l << " " << r << "\n";;
        maxi=max(maxi,r-l+1);
    }
    if(db>1)db++;
    cout << db << '\n';
    if(maxi==1)maxi=-1;
    cout << maxi;
}

	Sum	Test	Verdict		Time	Memory
base	67/70
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	25ms	748 KiB
		3	Partially correct	2/3	1ms	316 KiB
		4	Accepted	3/3	1ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	372 KiB
		7	Partially correct	2/3	1ms	316 KiB
		8	Partially correct	2/3	1ms	500 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	1ms	316 KiB
		11	Accepted	3/3	2ms	316 KiB
		12	Accepted	3/3	2ms	408 KiB
		13	Accepted	4/4	2ms	316 KiB
		14	Accepted	4/4	14ms	756 KiB
		15	Accepted	4/4	17ms	648 KiB
		16	Accepted	4/4	17ms	680 KiB
		17	Accepted	4/4	18ms	664 KiB
		18	Accepted	4/4	19ms	564 KiB
		19	Accepted	4/4	27ms	564 KiB
		20	Accepted	4/4	25ms	564 KiB
		21	Accepted	4/4	28ms	564 KiB
		22	Accepted	4/4	23ms	564 KiB