OJ Board

I got it AC. I was mistaken when sorting values

I got a WA for 12376. According to the issue description, we start from 0th node and will always go to a stage that has the highest value. I might overlook something from it. Could anyone give a good direction or test cases for this problem? Input: 5 6 6 0 8 9 2 7 5 5 4 5 3 1 5 0 1 0 2 2 1 6 5 0 8 9...

Try this case
Hope this help The output should be

Hay mf
thx for your information, you are very experienced ... ^__^

Hai mf, thank about your information..
I got AC with 0.050 seconds using the stack (include<stack>)

Is it necessary to create own class stack ?
Which one is faster, own class stack or using the lib one ?

Thx Before.. Sorry for my language

Help me, i don't know why i got WA, i already test my code with many input...