Dynamic Range Minimum Queries

#include <iostream>
#include <vector>

using namespace std;

int main(){
    long long n, q;
    cin >> n >> q;
    vector<long long> arr(n+1);
    for (long long i=0;i<n;i++){
        cin >> arr[i+1];
    }

    vector<vector<long long>> queries(q, vector<long long>(3));
    for (long long i=0;i<q;i++){
        cin >> queries[i][0] >> queries[i][1] >> queries[i][2];
    }


    for (auto &q: queries){
        if (q[0]==1){
            //cout << "Doing query 1\n";
            arr[q[1]]=q[2];
        } else if (q[0]==2){
            //cout << "Doing query 2\n";
            long long minVal=arr[q[1]];
            for (long long i=q[1];i<=q[2];i++){
                minVal=min(minVal, arr[i]);
            }
            cout << minVal << '\n';
        }
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED