129722025-01-04 11:57:55feheristvanSíkság (55)cpp17Wrong answer 2/55300ms1056 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;
    bool t;
    for(int i = 0; i < n; i ++){
        minx = maxx = elemek[i];
        j = i;
        t = 1;
        while(j < n && t){
            if(elemek[j] > maxx)
                maxx = elemek[j];
            if(elemek[j] < minx)
                minx = elemek[j];
            if(maxx - minx >= 2)
                t = 0;
            else
                j ++;
        }
        if(vege - eleje + 1 < j - i){
            vege = j - 1;
            eleje = i;
            cout << eleje << " " << vege << endl;
        }
    }
    cout << vege - eleje + 1<< " " << eleje + 1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/55
1Wrong answer0/01ms320 KiB
2Wrong answer0/017ms500 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Accepted2/21ms396 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/31ms320 KiB
8Wrong answer0/22ms408 KiB
9Wrong answer0/31ms320 KiB
10Wrong answer0/316ms420 KiB
11Wrong answer0/33ms452 KiB
12Wrong answer0/3123ms324 KiB
13Wrong answer0/332ms948 KiB
14Time limit exceeded0/3300ms1012 KiB
15Time limit exceeded0/3300ms1056 KiB
16Time limit exceeded0/3300ms948 KiB
17Time limit exceeded0/3289ms948 KiB
18Time limit exceeded0/3280ms944 KiB
19Time limit exceeded0/3300ms948 KiB
20Time limit exceeded0/3300ms952 KiB
21Wrong answer0/3182ms692 KiB
22Time limit exceeded0/3286ms948 KiB