207432026-01-08 18:32:07KoszorusBlankaSíkság (55)cpp17Wrong answer 12/5532ms808 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector <int> M(N+1);
    for (int i = 1; i <= N; i++) { cin >> M[i]; }

    int dmax = 0, sorszam = 0;
    for (int i = 1; i <= N; i++) {
        int d = 1;
        if (M[i+1] == M[i] or M[i+1] == M[i]+1 or M[i+1] == M[i]-1) {
            d++;
            int x = M[i+1];
            for (int j = i+2; j <= N; j++) {
                if (M[j] == M[i] or M[j] == x) { d++; }else break;
            }
            if (d > dmax) {
                dmax = d;
                sorszam = i;
            }
            i = i+d-2;
        }
    }

    cout << dmax+1 << " " << sorszam-1;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base12/55
1Accepted0/01ms316 KiB
2Wrong answer0/03ms316 KiB
3Wrong answer0/21ms508 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/21ms404 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/34ms440 KiB
11Wrong answer0/33ms316 KiB
12Accepted3/33ms316 KiB
13Accepted3/330ms808 KiB
14Wrong answer0/317ms564 KiB
15Accepted3/324ms796 KiB
16Wrong answer0/330ms804 KiB
17Wrong answer0/332ms800 KiB
18Wrong answer0/332ms564 KiB
19Wrong answer0/332ms564 KiB
20Wrong answer0/332ms564 KiB
21Accepted3/317ms564 KiB
22Wrong answer0/326ms564 KiB