Блог пользователя kursatbakis0

Автор kursatbakis0, 10 лет назад, По-английски

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.net/contest/447/submission/7101619

  • Проголосовать: нравится
  • -2
  • Проголосовать: не нравится

»
10 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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)