146272025-01-21 11:59:25PappMatyasÉrdekes túra (70 pont)cpp17Wrong answer 43/7029ms732 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, A[100000], larg = 0, 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;
}
SubtaskSumTestVerdictTimeMemory
base43/70
1Accepted0/01ms500 KiB
2Wrong answer0/026ms564 KiB
3Partially correct2/31ms316 KiB
4Partially correct1/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Partially correct2/31ms508 KiB
10Partially correct2/31ms316 KiB
11Partially correct2/31ms508 KiB
12Partially correct2/32ms408 KiB
13Partially correct2/42ms316 KiB
14Partially correct2/414ms444 KiB
15Partially correct2/417ms492 KiB
16Partially correct2/417ms656 KiB
17Partially correct2/419ms620 KiB
18Partially correct2/419ms564 KiB
19Partially correct2/427ms620 KiB
20Partially correct2/425ms624 KiB
21Partially correct2/429ms564 KiB
22Partially correct2/423ms732 KiB