Alitaulukot

input/code.cpp: In function 'int main()':
input/code.cpp:39:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < a.size(); j++){
                            ~~^~~~~~~~~~
input/code.cpp:53:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < a.size(); j++){
                            ~~^~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
 
int minOutofSubarray(vector<vector<int>> &preProcessedList, int startPointer, int endPointer){
    int k = floor(log2(endPointer-startPointer+1));
 
    int startArray = preProcessedList[k][startPointer-1];
    int endArray = preProcessedList[k][endPointer-pow(2,k)];
    int mini = min(startArray, endArray);
    return mini;
}
int maxOutofSubarray(vector<vector<int>> &preProcessedList1, int startPointer, int endPointer){
    int k = floor(log2(endPointer-startPointer+1));
 
    int startArray1 = preProcessedList1[k][startPointer-1];
    int endArray1 = preProcessedList1[k][endPointer-pow(2,k)];
    int maxi = max(startArray1, endArray1);
    return maxi;
}
int main(){
    int n;
    int k;
    cin >> n;
    cin >> k;
    vector<int> a;
    int in;
    for(int i = 0; i < n; i++){
        cin >> in;
        a.push_back(in);
    }
    int numOfit = ceil(log2(a.size()))-1;
    int s;
    vector<vector<int>> preArrayMin;
    vector<vector<int>> preArrayMax;
    for(int i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMin.push_back({});
            for(int j = 0; j < a.size(); j++){
                preArrayMin[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMin.push_back({});
        for(int l = 0; l < a.size()-pow(2,i)+1; l++){
            s = min(preArrayMin[i-1][l],preArrayMin[i-1][l+pow(2,i-1)]);
            preArrayMin[i].push_back(s);
        }
    }
    for(int i = 0; i<=numOfit; i++){
        if(i==0){
            preArrayMax.push_back({});
            for(int j = 0; j < a.size(); j++){
                preArrayMax[0].push_back(a[j]);
            }
            continue;
        }
        preArrayMax.push_back({});
        for(int l = 0; l < a.size()-pow(2,i)+1; l++){
            preArrayMax[i].push_back(max(preArrayMax[i-1][l],preArrayMax[i-1][l+pow(2,i-1)]));
        }
        
    }
    
    int i = 1;
    int j = 1;
    long count = 0;
    int max;
    int min;
    i = 1;
    j = 1;
    
    while(true){
        /*for(int c = 0; c < j-i; c++){
            cout << a[i+c-1] << " ";
        }*/
        cout << "\n";
        if(j == n){
            count += ((j-i+1)*(j-i+2)/2);
            break;
        }
        min = minOutofSubarray(preArrayMin, i, j);
        max = maxOutofSubarray(preArrayMax, i, j);
        if(max-min>k){
            j--;
            count += j-i+1;
            i++;
            if(j<i){
                j = i;
            }
            continue;
        }
        j++;
    }
    cout << count;
    
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: WRONG ANSWER