90分求调

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

const int N = 1e5 + 5;

int m, n;
int a[N], x, y;
deque<int> nums;

void solve(int x, int y) {
    for (int i = 1; i <= n; i ++) {
        while (!nums.empty() && a[nums.back()] >= a[i]) nums.pop_back();
        nums.push_back(i);
    }
    printf("%d ", a[nums.front()]);
}

int main() {
    scanf("%d %d", &m, &n);
    for (int i = 1; i <= m; i ++) scanf("%d", &a[i]);

    for (int i = 1; i <= n; i ++) {
        scanf("%d %d", &x, &y);
        solve(x, y);
        while (!nums.empty()) nums.pop_back();
    }
    return 0;
}