You are viewing a single comment's thread. Return to all comments →
Got exactly the same problem: Input (stdin): 1 6 4 1 2 2 3 3 4 1 5
And no starting index at the end of input, but there is expected output, which is fit to s=0.
Seems like cookies are disabled on this browser, please enable them to open this website
BFS: Shortest Reach in a Graph
You are viewing a single comment's thread. Return to all comments →
Got exactly the same problem: Input (stdin): 1 6 4 1 2 2 3 3 4 1 5
And no starting index at the end of input, but there is expected output, which is fit to s=0.