题目增减序列

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long a[110000];
//long long b[10005];
int main()
{
    ll n;
    cin >> n;
    for(ll i = 1;i <= n;++i){
        cin >> a[i];
    }
    ll p = 0;
    ll q = 0;
    ll temp;
    for(ll i = 2;i <= n;++i){
        temp = a[i] - a[i - 1];
        if(temp > 0) p += temp;
        else if(temp < 0) q -= temp;
    }
    cout << max(p,q) << endl;
    cout << abs(p - q) + 1;
}