OJ Board

Strange!! I try to use greedy & bfs to solve this problem, but WHY i got AC??

My code failed for this input: It should return 14, but my code return 16!!

rejudge? =)

result is a variable containing the maximum-streak from each testcase. Ofcourse I have it initialized properly.

In the problem description, we can found that there will be NO 0 (zero) bet in each input-set, only negative or positive value will exists. Do we agree with this? If so, I think it's ...

hmm.. i don't understand. I think there's an invalid statement in this problem.
Each bet is an integer greater than 0 and less than 1000. which means 0 < bet < 1000, right?

but i got WA because of this one...
if ( result < 0 ) puts( "Losing streak." );
and i got AC when..
if ( result <= 0 ...

[quote="Antonio Ocampo"]
Therefore H>=L always , so isn

Your code failed when there's any input like : 0 1 9
It should output 'Stop' instead of 'Continue'.

Tips :
Do checking step by step, ie. first check for 'Illegal state', then 'Illegal move', 'Move not allowed', 'Stop', and finally 'Continue' if the input pass all the checking. This way your code ...

The terms top left and bottom right do not imply any ordering of coordinates.

It means 'left' in this problem is not really-left in common sense
tricky statement it is.