OJ Board

Any idea how to solve it?

or please just explain the case following:

50 50 50
50 50 50
50 50 50
50 50 50
50 50 50
50 50 50

47.46


thx in advance!

ACed finally!
Very silly bug

thank you for all your helps!

Thanks Jan!

but then, any other tricky I/Os?
really have no idea why keeping WA

can anybody check it for me?

Input:
49
2 10
11 20
90000 4560
489000 94561
334142 334142
334143 500000
2 334141
2 100000
100000 200000
200000 300000
300000 400000
400000 500000
2 100
100 200
200 300
300 400
400 500
500 600
600 700
700 800
800 900
900 1000
1000 1100
1100 1200
1200 1300
1300 1400 ...

keeping WA...
which number's sopf function value is 15?

http://online-judge.uva.es/board/viewtopic.php?t=17684

read this and know why

I tried to solve the problem with brute force and got certainly TLE.
could anyone tell me how to optimize it or any other algorithm for this problem?

thx in advance

mmonish wrote:yes.
That's the exact reason.

Thank you for your post, I should read the problem and your previous post carefully next time

think this what's the size for 32*8 and 32*9

hope this help

thank you for your test cases!

I really misunderstood the problem

Can anyone give some critical test cases?

I have ACed this problem by using linked list which is very easy to understand but cost 100+ coding lines.

could anyone show me how to code just with array or something else?
thx in advance!

what's wrong with the judge?

when i set INFINITY as "20000000" and got AC
when i set INFINITY as "2000000" and got WA

any suggestion?

So, there are values in the judge input for which your calculation result is greater than 2000000.

But the thing is that
1: the description of input says the ...

what's wrong with the judge?

when i set INFINITY as "20000000" and got AC
when i set INFINITY as "2000000" and got WA

any suggestion?

Can someone please look at my code and tell me what's wrong??
I've got BOUNDLESS WA !! :cry:
I think it's just an application of Floyd, so where's my wrong??
any comment is welcome !! Thanks in advance ~~
// Q534 Frogger
// select the minimum of longest jumps ~~ minimax

#include<iostream ...