249172026-02-16 18:57:11GergoszaboÉrdekes túra (70 pont)cpp17Wrong answer 43/7028ms1076 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) maxsize = cursize;
    }
    cout << szam << "\n";
    if (szam == 0) cout << -1;
    else cout << maxsize;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base43/70
1Accepted0/01ms316 KiB
2Wrong answer0/024ms1076 KiB
3Wrong answer0/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Partially correct2/31ms500 KiB
10Partially correct2/31ms384 KiB
11Partially correct2/31ms324 KiB
12Partially correct2/32ms316 KiB
13Partially correct2/42ms316 KiB
14Partially correct2/414ms564 KiB
15Partially correct2/417ms636 KiB
16Partially correct2/417ms820 KiB
17Partially correct2/418ms820 KiB
18Partially correct2/418ms1044 KiB
19Partially correct2/426ms1076 KiB
20Partially correct2/425ms1076 KiB
21Partially correct2/428ms1076 KiB
22Partially correct2/420ms1076 KiB