Problem Description
Today, Bob plays with a child. There is a row of
n numbers. One can takes a number from the left side or the right side in turns and gets the grade which equals to the number. Bob knows that the child always chooses the bigger number of the left side and right side. If the number from two sides is equal, child will always choose the left one.
The child takes first and the person who gets more grade wins. The child will be happy only when he wins the game.
Bob wants to make the child happy, please help him calculate the minimal difference of their grades when he loses the game.
The child takes first and the person who gets more grade wins. The child will be happy only when he wins the game.
Bob wants to make the child happy, please help him calculate the minimal difference of their grades when he loses the game.
Input
There are T test cases (
T≤2 ).
For each test case:
t
For each test case:
t
最低0.47元/天 解锁文章
扫一扫
632
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
