## Search found 10 matches

Fri Sep 19, 2008 1:09 pm
Forum: Volume 114 (11400-11499)
Topic: 11489 - Integer Game
Replies: 9
Views: 3796

### 11489 - Integer Game

Anyone give me any hints:) Really cool Problem
Wed Nov 21, 2007 6:41 am
Forum: Algorithms
Topic: Suffix tree construction
Replies: 13
Views: 4471
use rapidshare or any other one click hosting service to upload ur files.
Tue Nov 20, 2007 10:02 am
Forum: Algorithms
Topic: Suffix tree construction
Replies: 13
Views: 4471
u can try ebookee.com
Sun Mar 04, 2007 8:43 am
Forum: Volume 105 (10500-10599)
Topic: 10525 - New to Bangladesh?
Replies: 50
Views: 19736
thanks helloneo , i got acceepted.
Sun Mar 04, 2007 7:18 am
Forum: Volume 105 (10500-10599)
Topic: 10525 - New to Bangladesh?
Replies: 50
Views: 19736
Any one tell me why i presentation error. I tried in many ways but without any success.

ac

[quote]
Tue Feb 27, 2007 9:18 pm
Forum: Algorithms
Topic: any idea?
Replies: 0
Views: 1344

### any idea?

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...
Fri Feb 16, 2007 2:53 pm
Forum: Volume 110 (11000-11099)
Topic: 11011 - Numerical Methods! A Satire
Replies: 11
Views: 6273
@@
Sat Feb 10, 2007 1:54 pm
Forum: Volume 110 (11000-11099)
Topic: 11011 - Numerical Methods! A Satire
Replies: 11
Views: 6273
////
Thu Jan 25, 2007 12:54 pm
Forum: Volume 9 (900-999)
Topic: 957 - Popes
Replies: 15
Views: 6954

### 957 - Popes

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: 14858
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.