1100*B. Chip and Ribbon（贪心&数学）

Problem - B - Codeforces

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
int n,x,a[N]; 
void solve(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);	
	}
	int res=0;
	a[0]=1;
	for(int i=n;i>=1;i--){
		if(a[i]<=a[i-1]) continue;
		res+=a[i]-a[i-1];
	}
	printf("%lld\n",res);
}
signed main(){
	int t=1;
	scanf("%lld",&t);
	while(t--) solve();
	return 0;
}