Sunset

input/code.cpp: In function 'int main()':
input/code.cpp:8:15: warning: variable 'I' set but not used [-Wunused-but-set-variable]
     int n, q, I, a, b, e, k, d;
               ^

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n, q, I, a, b, e, k, d;
    cin >> n >> q;
    int h[n], P[17][n], A[17];
    set <pair<int,int>> Se;
    set <pair<int,int>> :: iterator it;
    A[0] = 1;
    for (int i = 1; i < 17; i++)
    {
        A[i] = A[i-1] * 2;
    }
    for (int i = 0; i < n; i++)
    {
        cin >> h[i];
    }
    Se.insert({0,0});
    for (int i = n-1; i >= 0; i--)
    {
        it = Se.lower_bound({h[i],-1});
        if (it != Se.end() && it->first == h[i])
        {
            it++;
        }
        if (it == Se.end())
        {
            Se.clear();
            Se.insert({0,0});
            P[0][i] = -1;
        }
        else
        {
            I = it->second;
            it--;
            while (it != Se.begin())
            {
                Se.erase({it->first,it->second});
                it = Se.lower_bound({h[i],-1});
                it--;
            }
            it++;
            P[0][i] = it->second;
        }
        Se.insert({h[i],i});
    }
    for (int i = 1; i <= 16; i++)
    {
        for (int y = 0; y < n; y++)
        {
            if (P[i-1][y] != -1 && P[i-1][P[i-1][y]] != -1)
            {
                P[i][y] = P[i-1][P[i-1][y]];
            }
            else
            {
                P[i][y] = -1;
            }
        }
    }
    for (int i = 0; i < q; i++)
    {
        cin >> a >> b;
        a--;
        b--;
        e = 16;
        k = 0;
        d = a;
        while (true)
        {
            while (e >= 0 && (P[e][d] == -1 || P[e][d] > b))
            {
                e--;
            }
            if (e < 0)
            {
                break;
            }
            k += A[e];
            d = P[e][d];
        }
        cout << k+1 << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED

Test 32

Group: 3

Verdict: ACCEPTED

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: ACCEPTED

Test 35

Group: 3

Verdict: ACCEPTED

Test 36

Group: 3

Verdict: ACCEPTED

Test 37

Group: 3

Verdict: ACCEPTED

Test 38

Group: 3

Verdict: ACCEPTED

Test 39

Group: 3

Verdict: ACCEPTED

Test 40

Group: 3

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED