Dynamic Range Minimum Queries

#include <iostream>
#include <vector>
#include <climits>
using namespace std;


void update(int k, int x, vector<int>& tree, int n) {
    k += n;
    tree[k] = x;
    for (k /= 2; k >= 1; k /= 2) {
        tree[k] = min(tree[2*k], tree[2*k+1]);
    }
}


int minimum(int a, int b, vector<int>& tree, int n) {
    a += n; b += n;
    int s = INT_MAX;
    while (a <= b) {
        if (a % 2 == 1) s = min(s, tree[a++]);
        if (b % 2 == 0) s = min(s, tree[b--]);
        a /= 2; b /= 2;
    }
    return s;
}

int main() {
    int n, q;
    cin >> n >> q;

    vector<int> nums(n);
    for (int i = 0; i < n; i++) cin >> nums[i];

    vector<int> tree(2*n);

    for (int i = 0; i < n; i++) {
        tree[n+i] = nums[i];
    }

    for (int i = n-1; i > 0; i--) {
        tree[i] = min(tree[2*i], tree[2*i+1]);
    }

    for (int i = 0; i < q; i++) {
        int t, a, b;
        cin >> t >> a >> b;
        if (t == 1) {
            update(a, b, tree, n);  
        } else {
            cout << minimum(a, b, tree, n) << "\n";
        }
    }

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER