26  1 s   128 MB

## Description

Ryuju has developed his own video game. The game has N levels and each successfully completed level is worth a certain number of points, which add up to the players total score on an online rank list of all players. Ryuju has ordered his levels by difficulty from the easiest to the most difficult, but he has made a mistake and made some difficult levels worth less points than some of the easier ones.

To overcome this problem, Ryuju has decided to reduce the number of points for certain levels with the goal of making the point sequence  strictly increasing (so in the end easier levels are worth less points than the difficult ones).

Help Ryuju fix his video game in such a way that the  total number of points reduced is minimal

Final points have to be positive. You can assume that a solution exists for each test case.

## Input

The input consists of T test cases. The number of test cases T is given in the first line of the input.

The first line of each test case contains one positive integer N ( 1 ≤ N ≤ 100 ), the number of levels.

The next N lines of each test case contains positive integers less than 20,000, the number of points that Ryuju has associated with each level, from the first to the last level.

## Output

The first and only line of output of each test case should contain one number -- the minimum total number of points Ryuju has to subtract to fulfill requirements given in the task statement above.

### Sample Output

2
3
5
5
5
4
5
3
7
5
3
6`

## Source

COCI 2010-2011 Round 6