Dynamic Range Minimum Queries

#include <iostream>
#include <vector>
#include <string>
#include <format>
#include <algorithm>
#include <climits>


int main (int argc, char **argv) {

    int n, q;
    std::cin >> n >> q;

    std::vector<int> numbers(n, 0);
    for (int i=0; i<n; i++) {
        std::cin >> numbers[i];
    }

    //std::cout << std::format("{}", numbers) << std::endl;

    std::vector<int> tree(2 * n, 0);
    for (int i=0; i<n; i++) {
        tree.at(n + i) = numbers.at(i);
    }
    //std::cout << std::format("{}", tree) << std::endl;
    for (int i=n-1; i>0; i--) {
        tree.at(i) = std::min(tree.at(2*i), tree.at(2*i+1));
    }
    //std::cout << std::format("{}", tree) << std::endl;

    std::string result;
    for (int i=0; i<q; i++) {
        int t, a, b;
        std::cin >> t >> a >> b;
        
        //std::cout << "t: " << t << " a: " << a << " b: " << b << std::endl;
        if (t == 1) {
            int pos = (a - 1) + n;
            tree.at(pos) = b;

            pos = pos / 2;
            while (pos > 0) {
                tree.at(pos) = std::min(tree.at(2*pos), tree.at(2*pos+1));
                pos = pos / 2;
            }
        } else {
            int l = (a - 1) + n;
            int r = b + n;
            int minimum = INT_MAX;
            

            while (l < r) {
                if (l % 2 == 1) {
                    minimum = std::min(minimum, tree.at(l));
                    l++;
                }
                if (r % 2 == 1) {
                    r--;
                    minimum = std::min(minimum, tree.at(r));
                }
                l = l / 2;
                r = r / 2;
            }

            result += std::to_string(minimum) + '\n';
        }
    }

    std::cout << result << std::endl;


    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED