#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
    vector<int> nums = {8, 2, 4, 7};
    int limit = 4;
    int n = nums.size();
    int maximum = 1; 
 
    for(int i = 0; i < n; i++) {
        int minimum = nums[i];
        int currentMax = nums[i];
 
        for(int j = i; j < n; j++) {
            minimum = min(minimum, nums[j]);
            currentMax = max(currentMax, nums[j]);
 
            if(currentMax - minimum <= limit) {
                maximum = max(maximum, j - i + 1);
            } else {
                break;
            }
        }
    }
 
    cout << maximum << endl;
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICB2ZWN0b3I8aW50PiBudW1zID0gezgsIDIsIDQsIDd9OwogICAgaW50IGxpbWl0ID0gNDsKICAgIGludCBuID0gbnVtcy5zaXplKCk7CiAgICBpbnQgbWF4aW11bSA9IDE7IAoKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBpbnQgbWluaW11bSA9IG51bXNbaV07CiAgICAgICAgaW50IGN1cnJlbnRNYXggPSBudW1zW2ldOwoKICAgICAgICBmb3IoaW50IGogPSBpOyBqIDwgbjsgaisrKSB7CiAgICAgICAgICAgIG1pbmltdW0gPSBtaW4obWluaW11bSwgbnVtc1tqXSk7CiAgICAgICAgICAgIGN1cnJlbnRNYXggPSBtYXgoY3VycmVudE1heCwgbnVtc1tqXSk7CgogICAgICAgICAgICBpZihjdXJyZW50TWF4IC0gbWluaW11bSA8PSBsaW1pdCkgewogICAgICAgICAgICAgICAgbWF4aW11bSA9IG1heChtYXhpbXVtLCBqIC0gaSArIDEpOwogICAgICAgICAgICB9IGVsc2UgewogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBtYXhpbXVtIDw8IGVuZGw7CiAgICByZXR1cm4gMDsKfQo=