Function icpc2016大连网络赛H 单调栈预处理连续取模

hdu5875
题解如题目。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>

using namespace std;
const int N = 1e5 + 100;

int a[N], id[N];
int l, r, n, m, t;
stack<int> s;

inline void init(){
	while(!s.empty()) s.pop();
}
int main() {
    scanf("%d", &t);
    while (t--) {
    	init();
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
        scanf("%d", &m);
        for (int i = n; i >= 1; i--) {
            while (!s.empty() && a[s.top()] > a[i]) s.pop();
            id[i] = (s.empty()) ? -1 : s.top();
            s.push(i);
        }
        while (m--) {
            scanf("%d%d", &l, &r);
            if (l == r) {
                printf("%d\n", a[l]);
            } else {
                int ans = a[l];
                while (id[l] != -1 && id[l] <= r)
                    ans %= a[id[l]], l = id[l];
                printf("%d\n", ans);
            }
        }
    }
    return 0;
}