146872025-01-27 19:56:34PappMatyasÉrdekes túra (70 pont)cpp17Accepted 70/7028ms712 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 > 1)
            {
                if(pot > larg)
                {
                    larg = pot;
                }
                ans++;
            }
            pot = 1;
        }
        else
        {
            pot++;
        }
    }

    if(pot > 1)
    {
        if(pot > larg)
        {
            larg = pot;
        }
        ans++;
    }
    cout << ans << "\n" << larg;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base70/70
1Accepted0/01ms316 KiB
2Accepted0/024ms564 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms500 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms384 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms408 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/32ms316 KiB
13Accepted4/42ms316 KiB
14Accepted4/414ms556 KiB
15Accepted4/417ms416 KiB
16Accepted4/417ms564 KiB
17Accepted4/417ms476 KiB
18Accepted4/418ms476 KiB
19Accepted4/425ms652 KiB
20Accepted4/424ms712 KiB
21Accepted4/428ms564 KiB
22Accepted4/421ms524 KiB