146422025-01-23 17:12:57BikficcÉrdekes túra (70 pont)cpp17Partially correct 68/7029ms556 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, x, y, larg = -1, ans = 0, pot=1;
    cin >> n;
    cin >> x;
    for(int i = 1; i < n; i++)
    {
        cin >> y;
        if(x == y)
        {
            if(pot > larg)
            {
                larg = pot;
            }
            if(pot > 1)
            {
                ans++;
            }
            pot = 1;
        }
        else
        {
            pot++;
            x=y;
        }
    }
    if(pot > larg)
    {
        larg = pot;
    }
     if(pot > 1)
            {
                ans++;
            }
    cout << ans << "\n" << larg;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base68/70
1Accepted0/01ms316 KiB
2Accepted0/025ms508 KiB
3Accepted3/31ms316 KiB
4Partially correct1/31ms508 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms392 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms556 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms344 KiB
11Accepted3/31ms316 KiB
12Accepted3/32ms504 KiB
13Accepted4/42ms368 KiB
14Accepted4/414ms396 KiB
15Accepted4/417ms316 KiB
16Accepted4/417ms508 KiB
17Accepted4/418ms316 KiB
18Accepted4/419ms316 KiB
19Accepted4/427ms316 KiB
20Accepted4/425ms500 KiB
21Accepted4/429ms316 KiB
22Accepted4/421ms396 KiB