Problem:
Range Minimum Query (RMQ)

Write a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:

find(s, t): report the minimum element in as, as+1, . . . ,at.

update(i, x): change ai to x.

Note that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.

Input

n q
com0 x0 y0
com1 x1 y1
...
comq−1 xq−1 yq−1

In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).

Output

For each find operation, print the minimum element.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 100000

If comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.

If comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.

Sample Input 1

3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2

Sample Output 1

1
2

Sample Input 2

1 3
1 0 0
0 0 5
1 0 0

Sample Output 2

2147483647
5

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Convert;
using static System.Math;
//using Debug;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{
    static void Main(string[] args)
    {
        Solve();
        //WriteLine(Solve());
    }
    static void Solve()
    {
        var nq = Input.ar;
        Func<long,long,long> func = (long val1, long val2) => Min(val1, val2);
        var seg = new SegmentTree<long>(nq[0],(1L<<31)-1,func);
        var res = new List<long>();
        while (nq[1]-- > 0)
        {
            var qu = Input.ar;
            if (qu[0] == 0)
                seg.Update(qu[1], qu[2]);
            else res.Add(seg.query(qu[1], qu[2] + 1));
        }
        WriteLine(string.Join("\n", res));
    }
}

public class Input
{
    public static string read => ReadLine();
    public  static int[] ar => Array.ConvertAll(read.Split(' '), int.Parse);
    public  static int num => ToInt32(read);
    public static long[] arL => Array.ConvertAll(read.Split(' '), long.Parse);
    public  static long numL => ToInt64(read);
    public static char[][] gred(int h) 
        => Enumerable.Repeat(0, h).Select(v => read.ToCharArray()).ToArray();
    public static int[][] ar2D(int num)
        => Enumerable.Repeat(0, num).Select(v => ar).ToArray();
    public static long[][] arL2D(int num)
        => Enumerable.Repeat(0, num).Select(v => arL).ToArray();
    public const long Inf = (long)1e18;
    public const double eps = 1e-6;
    public  const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public  const int MOD = 1000000007;
}

class SegmentTree<T>
{
    private List<T> item;
    private int _num;
    private Func<T, T, T> _func;
    private Func<T, T> updateFunc;
    private T _inf;

    public int Parent(int index)
        => (index + 1) / 2 - 1;
    public int Left(int index)
        => 2 * index + 1;
    public int Right(int index)
        => 2 * (index + 1);

    public SegmentTree(int num, T inf, Func<T, T, T> func, Func<T, T> updateFunc=null)
    {
        _func = func;
        _num = 1;
        _inf = inf;
        this.updateFunc = updateFunc ?? ((T value) => value);
        while (_num < num)
            _num *= 2;
        item = new List<T>(2 * _num - 1);
        for (var i = 0; i < 2 * _num - 1; i++)
            item.Add(inf);
    }
    public void Update(int index, T value)
    {
        index += _num - 1;
        item[index] = updateFunc(value);
        while (Parent(index) >= 0)
        {
            index = Parent(index);
            item[index] = _func(item[Left(index)], item[Right(index)]);
        }
    }
    public T query(int left, int right)
        => query(left, right, 0, 0, _num);
    private T query(int left, int right, int k, int l, int r)
    {
        if (r <= left || right <= l) return _inf;
        if (left <= l && r <= right) return item[k];
        else
            return _func(query(left, right, Left(k), l, (l + r) / 2), query(left, right, Right(k), (l + r) / 2, r));
    }
}