255812026-02-20 20:16:13MarcÉrdekes túra (70 pont)cpp17Wrong answer 42/7028ms804 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int>t(n+1);
    for(int i=1; i<=n; i++){
        cin >> t[i];
    }
    int l=1;
    int maxi=-1;
    int er=0;
    int db=-1;
    for(int r=2; r<=n; r++){
        if(t[r-1]==t[r]){if(r-l>1)db++; er++; l=r; }
        //cout << l << " " << r << "\n";;
        maxi=max(maxi,r-l+1);
    }
    if(db!=-1)db++;
    cout << db << '\n';
    cout << maxi;
}
SubtaskSumTestVerdictTimeMemory
base42/70
1Accepted0/01ms316 KiB
2Wrong answer0/024ms564 KiB
3Partially correct2/31ms316 KiB
4Wrong answer0/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Partially correct2/31ms316 KiB
10Partially correct2/31ms316 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/31ms316 KiB
13Partially correct2/42ms316 KiB
14Partially correct2/414ms564 KiB
15Partially correct2/417ms644 KiB
16Partially correct2/417ms696 KiB
17Partially correct2/417ms668 KiB
18Partially correct2/418ms564 KiB
19Partially correct2/426ms612 KiB
20Partially correct2/424ms800 KiB
21Partially correct2/428ms804 KiB
22Partially correct2/420ms760 KiB