129732025-01-04 11:58:26feheristvanSíkság (55)cpp17Time limit exceeded 31/55300ms1240 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 << vege - eleje + 1<< " " << eleje + 1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base31/55
1Accepted0/01ms320 KiB
2Accepted0/010ms320 KiB
3Accepted2/21ms320 KiB
4Accepted2/21ms320 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms320 KiB
7Accepted3/31ms320 KiB
8Accepted2/21ms508 KiB
9Accepted3/31ms392 KiB
10Accepted3/310ms508 KiB
11Accepted3/33ms320 KiB
12Accepted3/371ms412 KiB
13Accepted3/332ms1004 KiB
14Time limit exceeded0/3298ms920 KiB
15Time limit exceeded0/3298ms1240 KiB
16Time limit exceeded0/3284ms948 KiB
17Time limit exceeded0/3300ms1036 KiB
18Time limit exceeded0/3277ms1136 KiB
19Time limit exceeded0/3300ms948 KiB
20Time limit exceeded0/3300ms944 KiB
21Accepted3/3112ms692 KiB
22Time limit exceeded0/3293ms948 KiB