SCUT_Pein

#include #include #include using namespace std; #define maxn 108 int n,d[maxn][maxn]; int A[maxn]; inline int min(int a,int b) { return a>b?b:a; } void RMQ_init() { for(int i = 1;i <= n;i++) d[i

You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, d