| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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://mirror.codeforces.com/contest/447/submission/7101619
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)
solution. The code is not tested, it is written only to show the idea of solution.
Really thank you for the google link above. It made me understood clearly.