for i in range(int(input())):
n = int(input())
arr = [int(i) for i in input().split()]
diff_arr = []
for i in range(1,n-1):
diff_arr.append(max(0, max(arr[i-1]-arr[i]+1, arr[i+1]-arr[i]+1)))
if n % 2 == 1:
res = 0
for i in range(0,len(diff_arr),2):
res += diff_arr[i]
print(res)
else:
pos_res = []
half = len(diff_arr)//2
green = [diff_arr[i] for i in range(len(diff_arr)) if i%2 == 0]
red = [diff_arr[i] for i in range(len(diff_arr)) if i%2 == 1]
green_sum = 0
red_sum = sum(red)
for i in range(half + 1):
pos_res.append(green_sum + red_sum)
if i < half:
red_sum -= red[i]
green_sum += green[i]
print(min(pos_res))#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++)
cin >> a[i];
vector<ll> pr(n, 0), sf(n, 0);
for(int i = 2; i < n; i++)
pr[i] = max({0ll, a[i-2]+1-a[i-1], a[i]+1-a[i-1]}) + pr[i-2];
for(int i = n-3; i >= 0; i--)
sf[i] = max({0ll, a[i]+1-a[i+1], a[i+2]+1-a[i+1]}) + sf[i+2];
if(n%2){
cout << pr[n-1] << "\n";
}
else{
ll ans = min(pr[n-2], sf[1]);
for(int i = 1; i < n; i+= 2)
ans = min(ans, pr[i-1]+sf[i]);
cout << ans << "\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
cin >> tt;
while(tt--){
solve();
}
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |