255852026-02-20 20:30:14MarcÉrdekes túra (70 pont)cpp17Wrong answer 63/7029ms804 KiB
#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 db=0;
    for(int r=2; r<=n; r++){
        if(t[r-1]==t[r]){if(r-l>2){db++;} l=r; }
        //cout << l << " " << r << "\n";;
        maxi=max(maxi,r-l+1);
    }
    db++;
    cout << db << '\n';
    cout << maxi;
}
SubtaskSumTestVerdictTimeMemory
base63/70
1Accepted0/01ms316 KiB
2Accepted0/026ms564 KiB
3Accepted3/31ms316 KiB
4Wrong answer0/31ms316 KiB
5Partially correct2/31ms316 KiB
6Partially correct2/31ms316 KiB
7Partially correct2/31ms316 KiB
8Partially correct2/31ms316 KiB
9Accepted3/31ms404 KiB
10Accepted3/31ms316 KiB
11Accepted3/32ms500 KiB
12Accepted3/32ms316 KiB
13Accepted4/43ms316 KiB
14Accepted4/416ms748 KiB
15Accepted4/417ms564 KiB
16Accepted4/417ms564 KiB
17Accepted4/419ms592 KiB
18Accepted4/419ms564 KiB
19Accepted4/427ms760 KiB
20Accepted4/426ms564 KiB
21Accepted4/429ms804 KiB
22Accepted4/423ms764 KiB