LightOJ 1071 - Baker Vai

Problem Link: http://lightoj.com/volume_showproblem.php?problem=1071

Problem in short -

Given an m 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.