2357 최댓값과 최솟값

#include <stdio.h>
#include <algorithm>
#include <cmath>
#define MAX 1e9+5
 
using namespace std;
typedef long long ll;
 
ll maxT[2000005] = { 0 };
ll minT[2000005];
ll Tsize,maxTmp,minTmp;
 
void update(ll idx, ll num) {
    idx += Tsize-1;
    maxT[idx] = num;
    minT[idx] = num;
    while (idx > 1) {
        idx /= 2;
        maxT[idx] = max(maxT[idx * 2], maxT[idx * 2 + 1]);
        minT[idx] = min(minT[idx * 2], minT[idx * 2 + 1]);
    }
}
 
void maxNum(ll left, ll right, ll idx, ll nL, ll nR) {
    if (nR < left || right < nL) {
        return;
    }
    if (left <= nL&&nR <= right) {
        maxTmp = max(maxT[idx],maxTmp);        
        return;
    }
    ll mid = (nL + nR) / 2;
    maxNum(left, right, idx * 2, nL, mid);
    maxNum(left, right, idx * 2 + 1, mid + 1, nR);
}
 
void minNum(ll left, ll right, ll idx, ll nL, ll nR) {
    if (nR < left || right < nL) {
        return;
    }
    if (left <= nL&&nR <= right) {
        minTmp = min(minT[idx], minTmp);
        return;
    }
    ll mid = (nL + nR) / 2;
    minNum(left, right, idx * 2, nL, mid);
    minNum(left, right, idx * 2 + 1, mid + 1 , nR);
}
 
int main() { 
    ll n, m;
    scanf("%lld %lld", &n, &m);
    for (int i = 1; i < 1000; i++) {
        if (n < pow(2, i)) {
            Tsize = (int)pow(2, i);
            break;
        }
    }
    for (ll i = 1; i <= 2 * Tsize; i++) {
        minT[i] = 10000000;
    }
    for (ll i = 1; i <= n; i++) {
        ll x;
        scanf("%lld", &x);
        update(i, x);
    }    
 
    ll a, b;
    for (ll i = 1; i <= m; i++) {
        scanf("%lld %lld", &a, &b);
        maxTmp = 0;
        minTmp = MAX;
        maxNum(a, b, 1, 1, Tsize);
        minNum(a, b, 1, 1, Tsize);
        printf("%lld %lld\n", minTmp, maxTmp);
    }
}