129702025-01-04 11:46:11feheristvanSíkság (55)cpp17Wrong answer 19/55300ms976 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    vector <int> elemek;
    int x;
    cin >> n;
    for(int i = 0; i < n; i ++){
        cin >> x;
        elemek.push_back(x);
    }
    int minx, maxx, j, vege = 0, eleje = 0;
    for(int i = 0; i < n; i ++){
        minx = maxx = elemek[i];
        j = i;
        while(j < n  && maxx - minx < 2){
            if(elemek[j] > maxx)
                maxx = elemek[j];
            if(elemek[j] < minx)
                minx = elemek[j];
            j ++;
        }
        if(vege - eleje < j - i){
            vege = j - 1;
            eleje = i;
        }
    }
    cout << vege - eleje << " " << eleje + 1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base19/55
1Accepted0/01ms320 KiB
2Accepted0/017ms320 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/21ms320 KiB
6Accepted2/21ms320 KiB
7Wrong answer0/31ms320 KiB
8Accepted2/22ms500 KiB
9Accepted3/31ms508 KiB
10Accepted3/316ms508 KiB
11Accepted3/33ms320 KiB
12Wrong answer0/3123ms508 KiB
13Accepted3/334ms948 KiB
14Time limit exceeded0/3298ms976 KiB
15Time limit exceeded0/3300ms948 KiB
16Time limit exceeded0/3287ms948 KiB
17Time limit exceeded0/3280ms948 KiB
18Time limit exceeded0/3289ms924 KiB
19Time limit exceeded0/3300ms948 KiB
20Time limit exceeded0/3300ms948 KiB
21Accepted3/3184ms692 KiB
22Time limit exceeded0/3284ms944 KiB