求给位大神给解题思路：
题目如下
There is a number sequence A1,A2,...,An. Let f(i)=min{|Aj-Ai| ,j<i}. You only need to compute f(1)+f(2)+...+f(n).
Input
The first line is an integer c which shows the number of cases. For each case there is a single line. The first number is n and the next n positive integer is A1 to An. (n<10000, Ai<100000)
Output
For each case print the answer at a single line.
Sample Input
2
3 1 2 3
4 2 3 1 4
Sample Output
2
3
求思路呀求思路，我只有暴力的算法，结果显然就是超时，伤心

http://acm.hit.
大神加油

已发

会不会有什么特殊的数学问题之类？

求解题思路

ok，谢大神。默默地去读代码了。