题解 | 【模板】静态区间最值

# {
#     "name": "【模板】静态区间最值",
#     "group": "NowCoder",
#     "url": "https://www.nowcoder.com/practice/831a314449d44ea0b1db90ca626bcd1a?channelPut=tracker2",
#     "memoryLimit": 1024,
#     "timeLimit": 1000,
#     "srcPath": "d:\\python\\刷题\\模板_静态区间最值.py",
#     "author": "thirteen",
#     "create_date": "2025-12-14  12:06:56"
# }

#region head


fmax = lambda x, y: x if x > y else y
fmin = lambda x, y: x if x < y else y

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e
        if isinstance(v, int):
            v = [e] * v
        self._n = len(v)
        self._log = (self._n - 1).bit_length()
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)
        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n
        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n
        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1
        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)
        if left == self._n:
            return self._n
        left += self._size
        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1
        return self._n

    def min_left(self, right: int,
                f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)
        if right == 0:
            return 0
        right += self._size
        sm = self._e
        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)
        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

#endregion
def solve():
    n, q = MII()
    a = LII()

    init = [(x, x) for x in a]

    def op(x, y):
        return (fmin(x[0],y[0]),
                fmax(x[1],y[1]))

    e = (math.inf, -math.inf)

    seg = SegTree(op, e, init)

    for _ in range(q):
        typ, l, r = map(int, input().split())
        mn, mx = seg.prod(l - 1, r)   
        result.append(str(mn if typ == 1 else mx))


T = 1
# T = II()
for _ in range(T):
    result=[]
    solve()
    print('\n'.join(result))

区间查询，直接果断线段树了 ，c了个模板过来就过了