249162026-02-16 18:47:18GergoszaboÉrdekes túra (70 pont)cpp17Wrong answer 33/7028ms1080 KiB
#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n; cin >> n;
    vector<ll> v(n);
    for (int i = 0; i < n; i++){
        cin >> v[i];
    }
    ll szam = 0;
    ll maxsize = 0;
    ll cursize = 1;
    for (int i = 1; i < n; i++){
        if (v[i] == v[i-1] && cursize >= 3){
            szam++; cursize = 1;
        }
        else {
            cursize++;
        }
        if (maxsize < cursize) maxsize = cursize;
    }
    cout << szam << "\n";
    if (szam == 0) cout << -1;
    else cout << maxsize;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base33/70
1Accepted0/01ms316 KiB
2Wrong answer0/025ms1076 KiB
3Wrong answer0/31ms500 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Partially correct1/31ms316 KiB
7Partially correct1/31ms316 KiB
8Accepted3/31ms316 KiB
9Partially correct2/31ms408 KiB
10Partially correct2/31ms316 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/32ms316 KiB
13Partially correct2/42ms316 KiB
14Partially correct2/414ms564 KiB
15Partially correct2/417ms884 KiB
16Partially correct2/417ms960 KiB
17Partially correct2/418ms920 KiB
18Partially correct2/420ms1060 KiB
19Partially correct2/427ms1080 KiB
20Partially correct2/425ms1076 KiB
21Partially correct2/428ms1076 KiB
22Partially correct2/423ms1076 KiB