Submission #14,686

2025-01-27 19:54:08

cpp17

Partially correct 68/70

28ms

692 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;
    }
    if(pot > 1)
    {
        ans++;
    }
    cout << ans << "\n" << larg;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	68/70
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	24ms	560 KiB
		3	Accepted	3/3	1ms	316 KiB
		4	Partially correct	1/3	1ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	508 KiB
		7	Accepted	3/3	1ms	508 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	1ms	548 KiB
		11	Accepted	3/3	2ms	560 KiB
		12	Accepted	3/3	2ms	316 KiB
		13	Accepted	4/4	2ms	316 KiB
		14	Accepted	4/4	14ms	580 KiB
		15	Accepted	4/4	17ms	564 KiB
		16	Accepted	4/4	17ms	608 KiB
		17	Accepted	4/4	17ms	580 KiB
		18	Accepted	4/4	18ms	528 KiB
		19	Accepted	4/4	25ms	544 KiB
		20	Accepted	4/4	24ms	632 KiB
		21	Accepted	4/4	28ms	692 KiB
		22	Accepted	4/4	21ms	580 KiB