The bottom-right DP cell answers the original optimization problem. It uses every item and the full capacity. This lesson reads that cell as the exact maximum achievable value.
highlighted = computed this step
Final cell
The final cell is dp at all items and full capacity, with value 9. Why: that state is exactly the original problem.
dp[4,7]=9
Maximum value
No feasible subset can exceed value 9. Why: the recurrence has already compared every take-or-leave decision.
optimal value 9
Diagram note
The highlighted cell is recomputed from the same DP table as every other entry. Pixel positions are rounded for layout; every number shown is exact.