OJ Board

Just a little correction in the test cases posted by neilor -

TC#66 is wrong -

it should be
3 1 0 2
0 2 103

instead of
2 1 0 2
0 2 103

since the nodes are number from 0 to n-1.

Thanks for the cases. It helped a lot.

The following code submitted for 11687 gets WA in 0.004 secs. As you can see, the code does nothing. Just ends :D . Still 0.004 secs !!! :-?


int main()
{
return 0;
}


Does anyone gets 0.00 anymore.

Also, I have noticed, the same code gets different runtimes when run at different times. Like ...

what should be the output for this?


2

7
1
2
3
-34
3
3

7
3
3
-34
1
2
3


The problem says -

If more than one segment is maximally nice, choose the one with the longest cycle ride (largest j-i).

according to that, shouldn't be the output be

The nicest part of route 1 is between stops 1 and ...