Helping the Nature
传送门 Problem - 1700C - Codeforces 1700
思路
转化成对差分数组的一对点值修改。
对差分数组的操作如下:
对首元素-1,后面任意位置+1;
对1-n位置上任意元素-1,尾元素+1;
首元素+1;
跟这题是一样的 https://www.luogu.com.cn/problem/P7994
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define eb emplace_back
#define pob pop_back
#define rz resize
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define debug(a) cout<<#a<<"="<<a<<endl;
#define qwe(i,a,b) for(int i=a;i<=b;i++)
#define ewq(i,a,b) for(int i=a;i>=b;i--)
inline ll rr(){ll f=1,x=0;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');return f*x;}
using namespace std;
const ll INF=0x3f3f3f3f,inf=0x3f3f3f3f3f3f3f;
const ll mod[2]={int(1e9 + 7), 10007};
const int base[2]={29,31};
const int maxn=2e5+6;
ll qpow(ll x,ll n){ll ans=1;while(n>0){if(n&1)ans=ans*x%mod[1];x=x*x%mod[1];n>>=1;}return ans;}
int n;
ll a[maxn],d[maxn];
void init(/* arguments */) {
n=rr();
qwe(i,1,n) {a[i]=rr();}
a[n+1]=0;
qwe(i,1,n+1) d[i]=a[i]-a[i-1];
}
int main(int argc, char const *argv[]) {
int t=rr();
while (t--) {
init();
ll f=0,z=0;
qwe(i,2,n) {
if(d[i]<0) {f+=abs(d[i]);}
else z+=d[i];
}
d[1]-=f;
d[n+1]+=z;
std::cout << f+z+max(abs(d[1]),abs(d[n+1])) << '\n';
}
return 0;
}