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

object Main {

  trait Monoid[A]{
  	def op(a1: A, a2: A): A
  	def zero: A
  }

  class PersistentSegmentTree[A](val numOfNode: Int, val M: Monoid[A]){

  	sealed trait Tree{ val value: A }
  	case object Empty extends Tree{ val value: A = M.zero }
  	case class Node(value: A, left: Tree, right: Tree) extends Tree
  	object Node {
  		def apply(value: A) = new Node(value, Empty, Empty)
  		def apply(l: Tree, r: Tree) = new Node(M.op(l.value,r.value),l,r)
  	}

  	private val nil: Node = Node(M.zero,Empty,Empty)
  	private[this] var root: Tree = nil

  	private def updateRec(id: Int, x:A, l: Int = 0, r: Int = numOfNode, t: Tree = root): Tree = {
  		val m = (l + r)/2
  		def branch(now: Node): Node = {
  			if(r-l<=1)Node(M.op(now.value,x))
  			else if(id < m)Node(updateRec(id,x,l,m, now.left), now.right)
  			else Node(now.left,updateRec(id,x,m,r,now.right))
  		}
  		t match {
  			case now:Node => branch(now)
  			case now:Tree => branch(nil)
  			case _ => nil
  		}
  	}

  	def update(id: Int, x: A):Unit = {
  		root = updateRec(id, x)
  	}

  	def query(a: Int, b: Int, l: Int = 0, r: Int = numOfNode, t: Tree = root): A = {
  		val m = (l + r)/2
  		t match {
  			case now: Node => {
  				if(b<=l || r<=a)M.zero
  				else if(a<=l && r<=b)now.value
  				else M.op(query(a,b,l,m,now.left),query(a,b,m,r,now.right))
  			}
  			case _ => M.zero
  		}
  	}
  }

  def main(args: Array[String]): Unit = {
  	val line = scala.io.StdIn.readLine.split(" ").map(_.toInt)
  	val n = line(0)
  	val q = line(1)
  	val m = new Monoid[Int]{
  		def op(a1: Int, a2: Int): Int = a1 min a2
  		def zero: Int = Int.MaxValue
  	}

  	val segtree = new PersistentSegmentTree[Int](n,m)

  	for(i <- 1 to q){
  		val input = scala.io.StdIn.readLine.split(" ").map(_.toInt)
  		val x = input(1)
  		val y = input(2)
  		if(input(0)==0)segtree.update(x,y)
  		else println(segtree.query(x,y+1))
  	}
  }
}