Moon landing

input/code.cpp: In function 'void Test()':
input/code.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     scanf("%d%d", &n, &x);
      |     ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         scanf("%d", &a[i].v);
      |         ~~~~~^~~~~~~~~~~~~~~

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
typedef long long LL;

const int N=100005;

struct Node
{
    int p, v;
}a[N];

struct NodeGreater{
    bool operator()(const Node& A, const Node& B)
    {
        return A.v > B.v;
    }
};
struct NodeLess{
    bool operator()(const Node& A, const Node& B)
    {
        return A.v < B.v;
    }
};

std::priority_queue<Node, std::vector<Node>, NodeGreater> great;
std::priority_queue<Node, std::vector<Node>, NodeLess> less;

inline bool In(const Node& A, const int& l, const int& r)
{
    return (A.p <= r) && (A.p >= l);
}

void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n, x;
    scanf("%d%d", &n, &x);
    for(int i=1; i<=n; i++)
    {
        a[i].p = i;
        scanf("%d", &a[i].v);
    }
    int l = 1, r = 1;
    int ans_p = 0, ans_v = 0;
    great.push(a[1]);
    less.push(a[1]);
    Node t;
    while(r <= n)
    {
        // Get true max and min in
        t = great.top();
        while(!In(t, l, r))
        {
            great.pop();
            t = great.top();
        }
        int min = t.v;

        t = less.top();
        while(!In(t, l, r))
        {
            less.pop();
            t = less.top();
        }
        int max = t.v;

// printf("(%d,%d) %d-%d %d\n", l, r, max, min, max - min > x);
        // Callc
        if(max - min > x)
        {
            l++;
        } else {
            if(r-l+1 >= ans_v)
            {
                ans_v = r-l+1;
                ans_p = l;
            }
            r++;
            great.push(a[r]);
            less.push(a[r]);
        }
    }
    printf("%d %d", ans_p, ans_v);

    return 0;
}

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