OJ Board

Thank you, sidky! I have make out the table and solve the problem. It seems that table memorization would be more preferable when solving counting problem rather than using traditional backtrack algorithm.

I can't make out a quick method to get the answer. Normal backtrack algorithm just got TLE all the time. Is there some restrict condition to make the search faster?

I still couldn't believe it has such a simple solution... though I got AC. It seems that I have to look back to my student book about greedy algorithm...

10440 Ferry Loading II seems to be a search and optimization problem, but to my surprise, many solution only spent very little time. Is it a DP problem? I can't fnd the quick method, got TLE...and maybe WA that I don't ever know...
Could somebody give out some hint to solve the problem?

Would O(n^3) be enough to solve this problem?
I couldn't make out a more effective way...

That's right. Repeatedly prime test would be a much more time consuming stuff. Avoid this would save a lot of time.

Finally I got accepted...
Yeah, you are right about that.
I didn't understand the problem statement clearly.
Thank you for the help.

I have read all the posts about 10534, and used double LIS of O(nlogn) version, the bi_search also have been tested. But it still got WA, can someone tell me what's wrong with my code?
[cpp]
code deleted
[/cpp]

It was my email problem. I ahve changed it and received the replys from the judge. Thank you.

Since Aug 3, I haven't received any reply from the judge of my summissions. Why? I got several compile error bu I don't know what's wrong. What happened?

I change double to integer to make it work without floating_point error but failed. It still got error, but why???
[cpp]
#include <stdio.h>
#include <math.h>

#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define maxint 2147483647
#define dead 1e-15
#define abs(a) (((a ...

The problem description says, "Assuming that the robber can move at most one unit per time step". Then could the robber stay at one place for some time steps if there is no other way to go?

If I find two available routes for robber to move, should I output "Nothing known"?

B.T.W
[cpp]3 1 4
3
1 1 1 ...