for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a=[0]+a
ans=0
for i in range(1,n+1):
ans+=max(0,a[i]-a[i-1])
print(ans-1)#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const ll N=1e6;
void solve()
{
ll n,i,c[N],sum=0;
cin >> n;
if(n==1)
{
cin >> c[0];
cout << c[0]-1 << endl;
return;
}
c[n+1]=0;
for(i=1;i<=n;i++)
cin >> c[i];
for(i=1;i<=n;i++)
if(c[i]-c[i+1]>0) sum+=c[i]-c[i+1];
cout << sum-1 << endl;
}
signed main()
{
ios::sync_with_stdio(false) ;
cin.tie(0) ;
cout.tie(0) ;
int T= 1 ;
cin >> T;
while(T--)
{
solve() ;
}
return 0 ;
}437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |