I am having hard time in understanding the statement of problem Cow Run, USACO 2012 January Contest. I can't understand what the problem statement asks for.
At first, I thought problem was about finding a sequence of moves that, no matter how Bessie moves, guarantees that cows will end the run at a position no more than K units distance away from the initial position.
But, then, why are Bessie's moves provided?
I would appreciate any help.