给你一个m行n列的格子的棋盘，每个格子里面有一个非负数。

从中取出若干个数，使得任意的两个数所在的格子没有公共边，

并且取出的数的和最大。-Give you a line n out of m chessboard lattice, each lattice has a non-negative. Removed from a number of the number, the number of arbitrary two lattice where there are no public side, and removed and the largest number.