[Poetize6] IncDec Sequence - 洛谷https://www.luogu.com.cn/problem/P4552
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
int n;
ll s[MAXN];
ll a[MAXN];
int main() {
scanf("%d", &n);
scanf("%lld", &s[1]);
ll rec1 = 0;
ll rec2 = 0;
for (int i = 2; i <= n; i++) {
scanf("%d", s + i);
a[i] = s[i] - s[i - 1];
if (a[i] > 0) {
rec1 += a[i];
} else {
rec2 += a[i];
}
}
printf("%lld\n%lld", max(rec1, abs(rec2)), abs(rec1-abs(rec2)) + 1);
return 0;
}