Kyselyt

#include <bits/stdc++.h>

#define ll long long
#define M 1000000007

using namespace std;

int x[222222];
bool u[222222];

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin>>n>>q;
    for (int i = 1; i <= n; i++) {
        cin>>x[i];
    }
    while (q --> 0) {
        int a, b;
        cin>>a>>b;
        int ans = 0;
        int i = b;
        for (int j = b; j >= a; j--) {
            while (i >= a && 2 * x[i] > x[j]) {
                i--;
            }
            if (i < a) break;
            if (!u[j]) {
                ans++;
                u[i] = 1;
                i--;
            }
        }
        for (int i = a; i <= b; i++) {
            u[i] = 0;
        }
        cout<<ans<<endl;
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED