Codeforces Round #802 (Div. 2) C. Helping the Nature

原题链接：Problem - C - Codeforces

题目描述：

Little Leon lives in the forest. He has recently noticed that some trees near his favourite path are withering, while the other ones are overhydrated so he decided to learn how to control the level of the soil moisture to save the trees.

There are nn trees growing near the path, the current levels of moisture of each tree are denoted by the array a1,a2,…,ana1,a2,…,an. Leon has learned three abilities which will help him to dry and water the soil.

• Choose a position ii and decrease the level of moisture of the trees 1,2,…,i1,2,…,i by 11.
• Choose a position ii and decrease the level of moisture of the trees i,i+1,…,ni,i+1,…,n by 11.
• Increase the level of moisture of all trees by 11.

Leon wants to know the minimum number of actions he needs to perform to make the moisture of each tree equal to 00.

Input

The first line contains a single integer tt (1≤t≤2⋅1041≤t≤2⋅104)  — the number of test cases. The description of tt test cases follows.

The first line of each test case contains a single integer nn (1≤n≤2000001≤n≤200000).

The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (−109≤ai≤109−109≤ai≤109) — the initial levels of trees moisture.

It is guaranteed that the sum of nn over all test cases doesn't exceed 200000200000.

Output

For each test case output a single integer — the minimum number of actions. It can be shown that the answer exists.

Example

input

Copy

4
3
-2 -2 -2
3
10 4 7
4
4 -4 4 -4
5
1 -2 3 -4 5

output

Copy

2
13
36
33

Note

In the first test case it's enough to apply the operation of adding 11 to the whole array 22 times.

In the second test case you can apply the operation of decreasing 44 times on the prefix of length 33 and get an array 6,0,36,0,3.

After that apply the operation of decreasing 66 times on the prefix of length 11 and 33 times on the suffix of length 11. In total, the number of actions will be 4+6+3=134+6+3=13. It can be shown that it's impossible to perform less actions to get the required array, so the answer is 1313.

算法分析：

整个序列都变为0，等价于其差分数组全部为0

三种操作等价于：

1. d1减1，di+1加1

2. di减1

3. d1加1

所以我们将问题转化为使用以上三种操作使得差分数组为全0；

我们可以得知：

能对除了1以外的其他位置加的操作只有1，

能对除了2以外的其他位置减的操作只有2，

所以对除了1以外的其他位置加或者减的都只有唯一方案，将其他位置操作完毕后再来单独处理d1即可。

代码（CPP）：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 2e5 + 10;
ll n, a[maxn], d[maxn];

int main()
{
    freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--)
    {
        // 输入并计算差分数组
        cin >> n;
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            d[i] = a[i] - a[i - 1];
        }
        // 处理d1以外的其他位置
        ll ans = 0;
        for (int i = 2; i <= n; i++)
        {
            if(d[i] >= 0)
                ans += d[i];
            else
            {
                ans += -d[i];
                d[1] += d[i];
            }
        }
        // 单独处理d1
        ans += abs(d[1]);
        // 输出结果
        cout << ans << endl;
    }
    return 0;
}