碰到段加法段减法时优先考虑差分,a表示愿数组d表示差分数组,可以将题意转为为将d全部转化为0,依题意三个转化可以变为d1-1 di+1;di-1;d1+1所以可以用操作1或者2将2-n转为0之后用操作2或者3将d1转化为0就可以
#include<bits/stdc++.h>
#define AC return 0;
#define int long long
using namespace std;
typedef pair<int, int> pii;
const int maxx = 100005;
const int mod = 1e9 + 7;
int n, m, t;
signed main() {
cin >> t;
while (t--) {
cin >> n;
vector<int>a(n + 1), d(n + 1);
for (int i = 1; i <= n; i++)cin >> a[i];
for (int i = 1; i <= n; i++)d[i] = a[i] - a[i - 1];
int res = 0;
for (int i = 2; i <= n; i++) {
if (d[i] < 0) {
d[1] += d[i];
res -= d[i];
} else if (d[i] > 0) {
res += d[i];
}
}
cout << res + abs(d[1]) << '\n';
}
AC
}