分治 Divide and Conquer 局部最小值 local optimal 棋盘问题

问题描述：

Suppose now that you're given an  n × n grid graph $G$. (An n × n graph is just the adjacency graph of an $n \times n$ chessboard. To be completely precise, it is a graph whose node set is the set of all ordered pairs of natural numbers $(i,j)$, where 1 <= i <=n and 1 <= j <= n; the nodes $(i,j)$ and $(k,l)$ are joined by an edge if and only if $|i-k|+|j-l|=1$.)
Each node v is labeled by a real number xv you may assume that all these labels are distinct. 

Show how to find a local minimum of G using only O(n) probes to the nodes of $G$. (Note that G has n^2 nodes.)

解题思路：

首先拿到这样的题，由于是要在O(n)的时间内得到解，暴力枚举的方法显然是行不通的。那么怎样才能找到分治的出路，使得问题的规模减小，并且得到的子