Search found 10 matches
Search found 10 matches • Page 1 of 1
The following problem is taken from zju.here is the link: http://acm.zju.edu.cn/show_problem.php?pid=2677 any idea how to solve it. Oil Deal Time limit: 5 Seconds Memory limit: 32768K Special Judge Total Submit: 600 Accepted Submit: 161 Oil is a very important strategic resource. Recently United Sta...
It's seems to me the problem of maximum sum of continuous sub sequences of length m. I know a linear algorithm when length m is not specified , but don't know how to extend it for specified length m. Can any one kind enough to give me a linear time algorithm for this problem , or any link describing...
- Sun Jan 21, 2007 10:51 am
- Forum: Volume 111 (11100-11199)
- Topic: 11158 - Elegant Permuted Sum
- Replies: 23
- Views: 15014
Can any one tell me how to solve it. Is it a DP problem , if so then how to solve it.It seems to me a longest path problem. I used backtracking and got TLE. plz help me.