Algorithm Designa60a_midp4_walk
Walk in the Forest
123b545d-7963-4d0a-8f9a-c16cd051c299.cppC++
1// Loading code...Selected Submission
100 / 100
0.013s
3360 KB
DP
Time Comp.
O(m*n)
Space Comp.
O(m*n)
Readability
5/10
"The code uses dynamic programming to find the maximum score achievable by traversing a 2D table. It builds a DP table where each cell stores the maximum score to reach that cell from the top-left corner, considering moves to the right, down, and diagonally down-right."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #8 | 100 | 8/24/2024 |
| Try #7 | 80 | 8/24/2024 |
| Try #6 | 0 | 8/24/2024 |
| Try #5 | 100 | 8/24/2024 |
| Try #4 | 100 | 8/24/2024 |
| Try #3 | 100 | 8/24/2024 |
| Try #2 | 100 | 8/24/2024 |
| Try #1 | 50 | 8/24/2024 |