ENG
RUS
Timus 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
1119
. Metro
If you get MLE using DP in Java
Posted by
SubmitRush
3 Oct 2009 06:23
Actually,
You can solve this problem with DP[2][N].
(it's a little strict Memory Limit in compare with the other DP problem in Java.)
Re: If you get MLE using DP in Java
Posted by
Plamen_N
3 Nov 2012 03:13
You can solve it using DP[N].
© 2000–2024
Timus Online Judge Team
. All rights reserved.