Sunset

input/code.cpp: In function 'int main()':
input/code.cpp:28:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &N, &Q);
    ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:30:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &H[i]);
       ~~~~~^~~~~~~~~~~~~
input/code.cpp:34:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d%d", &query[q].a, &query[q].b);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5;

struct Query {
   int i, a, b;
   bool operator<(Query q) const {
      if(a != q.a) return a > q.a;
      return i > q.i;
   }
};

int N, Q;
int H[MAXN + 10];
Query query[MAXN + 10];
int res[MAXN + 10];

vector<int> vec;
void add(int i) {
   while(!vec.empty() && H[i] >= H[vec.back()]) {
      vec.pop_back();
   }
   vec.push_back(i);
}

int main() {
   scanf("%d%d", &N, &Q);
   for(int i = 1; i <= N; i++) {
      scanf("%d", &H[i]);
   }
   for(int q = 0; q < Q; q++) {
      query[q].i = q;
      scanf("%d%d", &query[q].a, &query[q].b);
   }

   sort(query, query + Q);
   
   int a = N+1;
   for(int q = 0; q < Q; q++) {
      Query qq = query[q];
      //cerr << "qq.a = " << qq.a << "\n";
      while(a > qq.a) {
         a--;
         add(a);
      }
      //cerr << "vec = [ ";
      //for(int v : vec) //cerr << v << " ";
      //cerr << "]\n";
      res[qq.i] = upper_bound(vec.rbegin(), vec.rend(), qq.b) - vec.rbegin();
      //cerr << "[" << qq.a << ", " << qq.b << "] = " << res[qq.i] << "\n";
   }
   for(int q = 0; q < Q; q++) {
      printf("%d\n", res[q]);
   }
}

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