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 JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO ?????????????????????????????????????????????
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String[] tmpArray = br.readLine().split(" ");
		int n = Integer.parseInt(tmpArray[0]);
		int q = Integer.parseInt(tmpArray[1]);

		ArrayManager array = new ArrayManager(n);

		for(int i = 0; i < q; i++){
			tmpArray = br.readLine().split(" ");

			int x = Integer.parseInt(tmpArray[1]);
			int y = Integer.parseInt(tmpArray[2]);

			if(tmpArray[0].equals("0")){
				array.update(x, y);
			}
			else {
				int result = array.findMin(x, y);
				System.out.println(result);
			}
		}
	}

}

class ArrayManager {
	private int[] array;
	private int n;
	private final int INIT = (int)Math.pow(2, 31) - 1;

	public ArrayManager(int n){
		this.n = n;
		array = new int[n];

		Arrays.fill(array, INIT);
	}

	public void update(int index, int num){
		array[index] = num;
	}

	public int findMin(int s, int t){
		int min = Integer.MAX_VALUE;

		for(int i = s ; i <= t; i++){
			if(min > array[i]){
				min = array[i];
			}
		}

		return min;
	}
}