//B站关注 艾尔莎 喵
//All OK
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(9)
#define INF 1ll*1e10
#define LNF (1ll << 60)
#define PII pair<int, int>
#define PI acos(-1)
#define ll long long
// #define ll __int128 
#define int ll
#define endl '\n'
using namespace std;

const int N = 1e6 + 10;
int n;
ll a[N], b[N]; 

void solve(){
    ll ans = INF;
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    b[1] = a[1];
    ll res = 0;
    for(int i = 2; i <= n; i ++){
        b[i] = a[i];
        if(i & 1 && b[i - 1] <= b[i])
            res += abs(b[i - 1] - b[i]) + 1, b[i] = b[i - 1] - 1;
        else if(!(i & 1) && b[i - 1] >= b[i])
            res += abs(b[i - 1] - b[i]) + 1, b[i] = b[i - 1] + 1;
    }
    ans = min(ans, res);
    res = 0;
    for(int i = 2; i <= n; i ++){
        b[i] = a[i];
        if(i & 1 && b[i - 1] >= b[i])
            res += abs(b[i - 1] - b[i]) + 1, b[i] = b[i - 1] - 1;
        else if(!(i & 1) && b[i - 1] <= b[i])
            res += abs(b[i - 1] - b[i]) + 1, b[i] = b[i - 1] + 1;
    }
    cout << min(ans, res) << endl;
}   

signed main(){
    ios;

    // init();
    int _ = 1;
    cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case " << __ << ": ";
        solve();
    }

    return 0;
}