#include <bits/stdc++.h>
#include <unordered_map>
#define int long long
#define inf 1e18
#define re register
#define N 1020203
using namespace std;
const int mo=1000000007;
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}
int a[N];
void solve(){
	int n=read(),ans1=0,ans2=0;
	for (int i=1;i<=n;++i)a[i]=read();
	for (int i=2;i<=n;++i)
		if (i&1){
			if (a[i]>=a[i-1])ans1+=a[i]-a[i-1]+1,a[i]=a[i-1]-1;
		}else{
			if (a[i]<=a[i-1])ans1+=a[i-1]-a[i]+1,a[i]=a[i-1]+1;
		}
	for (int i=2;i<=n;++i)
		if (i&1){
			if (a[i]<=a[i-1])ans2+=a[i-1]-a[i]+1,a[i]=a[i-1]+1;
		}else{
			if (a[i]>=a[i-1])ans2+=a[i]-a[i-1]+1,a[i]=a[i-1]-1;
		}
	cout<<min(ans1,ans2)<<endl;
}
signed main(){
    int T=read();
    while (T--)solve();
    return 0;
}