Moon landing

#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

#define INIT_MIN UINT64_MAX
#define INIT_MAX 0

uint64_t tab_len = 0;
uint64_t *tree_min;
uint64_t *tree_max;

uint64_t max(uint64_t a, uint64_t b){
    return a > b ? a : b;
}

uint64_t min(uint64_t a, uint64_t b){
    return a < b ? a : b;
}

void init_tree_max(){
    for(uint64_t i = tab_len - 1; i >= 1; i--)
        tree_max[i] = max(tree_max[2*i], tree_max[2*i+1]);
}

uint64_t find_range_max(uint64_t a, uint64_t b){
    a += tab_len;
    b += tab_len;
    uint64_t acc = INIT_MAX;
    while (a <= b){
        if (a%2 == 1)
            acc = max(acc, tree_max[a++]);
        if (b%2 == 0)
            acc = max(acc,tree_max[b--]);
        a /= 2;
        b /= 2;
    }
    return acc;
}
void init_tree_min(){
    for(uint64_t i = tab_len - 1; i >= 1; i--)
        tree_min[i] = min(tree_min[2*i], tree_min[2*i+1]);
}

uint64_t find_range_min(uint64_t a, uint64_t b){
    a += tab_len;
    b += tab_len;
    uint64_t acc = INIT_MIN;
    while (a <= b){
        if (a%2 == 1)
            acc = min(acc, tree_min[a++]);
        if (b%2 == 0)
            acc = min(acc,tree_min[b--]);
        a /= 2;
        b /= 2;
    }
    return acc;
}


int main() {
    uint64_t n = 0;
    uint64_t x = 1;
    if (scanf("%ld %ld", &n, &x) == 0)
        return EXIT_FAILURE;

    tab_len = n;
    // rounding to the next power of two, adapted for 64 integer from https://graphics.stanford.edu/%7Eseander/bithacks.html#RoundUpPowerOf2
    tab_len--; // so powers of two become stay constant after all operations;
    tab_len |= tab_len >> 1;
    tab_len |= tab_len >> 2;
    tab_len |= tab_len >> 4;
    tab_len |= tab_len >> 8;
    tab_len |= tab_len >> 16;
    tab_len |= tab_len >> 32;
    tab_len++;

    tree_min = (uint64_t *) calloc(tab_len*2, sizeof(uint64_t));
    tree_max = (uint64_t *) calloc(tab_len*2, sizeof(uint64_t));

    for (uint64_t i = 0; i < n; i++){
        if (scanf("%ld", tree_min + tab_len + i) == 0)
            return EXIT_FAILURE;
        tree_max[tab_len+i] = tree_min[tab_len+i];
    }
    for (uint64_t i = n; i < tab_len; i++){
        tree_min[tab_len + i] = INIT_MIN;
        tree_max[tab_len + i] = INIT_MAX;
    }

    init_tree_max();
    init_tree_min();

    uint64_t mina = 0;
    uint64_t mins = 1;

    uint64_t a = 0;
    for (uint64_t b = 0; b < n; b++){
        // printf("a=%ld, acar=%ld, b=%ld, min=%ld, max=%ld\n", a, tree_max[tab_len+a], b, find_range_min(a, b), find_range_max(a, b));
        while (find_range_max(a, b) - find_range_min(a, b) > x)
            a++;
        if (b-a + 1 > mins){
            mins = b-a+1;
            mina = a;
        }
    }

    printf("%ld %ld", mina+1, mins);



    return EXIT_SUCCESS;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED