water problem(线段树 容易)

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;
typedef struct node
{
    ll l,r;
    ll num;
}node;
const ll maxn = 100000;
ll N,M,Q;
node tree [maxn * 4];

void build(ll l,ll r,ll i)
{
    tree[i].l = l,tree[i].r = r;
    if(l == r)
    {
        cin >> tree[i].num;
        tree[i].num %= M;
        return;
    }
    ll mid = (l+r) / 2;
    build(l,mid,i*2);
    build(mid+1,r,i*2 + 1);
    tree[i].num = max(tree[i*2].num,tree[i*2 + 1].num);
}

ll query(ll l,ll r,ll i)
{
    if(tree[i].l == l && tree[i].r == r)
    {
        return tree[i].num;
    }
    ll mid = (tree[i].l+tree[i].r) / 2;//注意这里
    if(r <= mid)
    {
        return query(l,r,i*2);
    }
    else if(l > mid)
    {
        return query(l,r,i*2 + 1);
    }
    else
    {
        return max(query(l,mid,i*2),query(mid+1,r,i*2 + 1));
    }
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        cin >> N >> M;
        build(1,N,1);
        cin >> Q;
        while(Q--)
        {
            ll l,r;
            cin >> l >> r;
            ll ans = query(l,r,1);
            cout << ans << endl;
        }
    }
    return 0;
}