kursatbakis0's blog

By kursatbakis0, 9 years ago, In English

In LightOj, I was trying to solve this DP problem but I got wrong answer , can you suggest a solution ? Here is the problem link : http://lightoj.com/volume_showproblem.php?problem=1071

And here is my solution http://codeforces.com/contest/447/submission/7101619

  • Vote: I like it
  • -2
  • Vote: I do not like it

9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

One can not view problem description before login into lightoj.
I have found by google link http://one-problem-a-day.blogspot.ru/2012_02_01_archive.html

"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." (I think route should be shortest possible)