Submission #14,628

2025-01-21 12:00:22

cpp17

Wrong answer 43/70

29ms

772 KiB

#include <iostream>

using namespace std;

int main()
{
    int n, A[100000], larg = -1, ans = 0, pot;
    cin >> n;
    cin >> A[0];
    for(int i = 1; i < n; i++)
    {
        cin >> A[i];
        if(A[i] == A[i - 1])
        {
            if(pot > larg)
            {
                larg = pot;
            }
            if(pot > 1)
            {
                ans++;
            }
            pot = 1;
        }
        else
        {
            pot++;
        }
    }
    if(pot > larg)
    {
        larg = pot;
    }
    cout << ans << "\n" << larg;
    return 0;
}

	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	316 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	508 KiB
		9	Partially correct	2/3	1ms	316 KiB
		10	Partially correct	2/3	1ms	316 KiB
		11	Partially correct	2/3	1ms	316 KiB
		12	Partially correct	2/3	2ms	540 KiB
		13	Partially correct	2/4	2ms	316 KiB
		14	Partially correct	2/4	14ms	500 KiB
		15	Partially correct	2/4	17ms	556 KiB
		16	Partially correct	2/4	17ms	640 KiB
		17	Partially correct	2/4	18ms	548 KiB
		18	Partially correct	2/4	19ms	564 KiB
		19	Partially correct	2/4	27ms	564 KiB
		20	Partially correct	2/4	25ms	772 KiB
		21	Partially correct	2/4	29ms	644 KiB
		22	Partially correct	2/4	21ms	564 KiB