249192026-02-16 19:05:24GergoszaboÉrdekes túra (70 pont)cpp17Wrong answer 46/7030ms1076 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 = -1;
    ll cursize = 1;
    for (int i = 1; i < n; i++){
        if (v[i] == v[i-1]){
            if (cursize >= 2) szam++;
            cursize = 1;
        }
        else {
            cursize++;
        }
        if (maxsize < cursize && cursize >= 2) maxsize = cursize;
    }
    if (maxsize <= cursize && cursize >= 2){
        maxsize = cursize; szam++;
    }
    cout << szam << "\n";
    if (maxsize == -1) cout << -1;
    else cout << maxsize;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base46/70
1Accepted0/01ms508 KiB
2Wrong answer0/026ms1076 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms324 KiB
6Accepted3/31ms532 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms508 KiB
9Partially correct2/31ms512 KiB
10Partially correct2/31ms500 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/32ms316 KiB
13Partially correct2/42ms552 KiB
14Partially correct2/414ms804 KiB
15Partially correct2/417ms820 KiB
16Partially correct2/417ms820 KiB
17Partially correct2/419ms892 KiB
18Partially correct2/420ms824 KiB
19Partially correct2/427ms1076 KiB
20Partially correct2/425ms1076 KiB
21Partially correct2/430ms1076 KiB
22Partially correct2/423ms1076 KiB