ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1303. Minimal Coverage

How to save the path to solution if using DP.
Posted by hliu20 21 May 2013 15:50
If using DP, it seems that saving the path to minimum value exceeds the MEMORY threshold. How to solve it?
Re: How to save the path to solution if using DP.
Posted by ძამაანთ [Tbilisi SU] 21 Oct 2013 20:28
How do you solve using DP? I used greedy algorithm and cuz of this I only saved only the optimal path (So, O(N) memory).