OJ Board

Haha,I got AC,too. I tried again,still used Newton Interpolation.But this time I used doubles instead of integers and check if the output is between 0 and 1000.

I used Newton Interpolation in the contest but get wrong answer all the time.Now I know that Newton Interpolation can't get the exact value of a1,a2,,,a6 if I just use Integers.

Our team use dynamic programming to slove it in O(n^2) time.

I using greedy algorithm.
if a[] present the time the first people use to set each problem and b[] for second.
if min(ai,aj,bi,bj)==ai or ==bj, then set the ith problem before the jth.
Furthermore if min(a1,b1...an,bn)==ak let k be the first one to be solved,
or if min(a1,b1...an,bn)==bk let k be ...