| Task: | Dynamic Range Minimum Queries |
| Sender: | banghalq |
| Submission time: | 2025-09-18 17:08:47 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | TIME LIMIT EXCEEDED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | details |
| #2 | TIME LIMIT EXCEEDED | -- | details |
Code
n,q = [int(x) for x in input().split()]
array = [int(x) for x in input().split()]
solution = []
for _ in range(q):
indic, k, u = [int(x) for x in input().split()]
if indic == 1:
array[k-1] = u
else:
solution.append(min(array[k-1:u]))
for elt in solution:
print(elt)
