Thursday, February 16, 2012

LightOJ 1071 - Baker Vai

Problem Link:

Problem in short -
Given an x n grid of numbers, you have move from top-left cell to the bottom-right cell and then get back to top-left cell without stepping on any cell twice and maximizing the sum of the numbers on the path.