https://www.acwing.com/problem/content/102/
思路: 差分
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long int a[N],b[N],n;
int main(void)
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],b[i]=a[i]-a[i-1];
long long int p=0,q=0;
for(int i=2;i<=n;i++)
if(b[i]>0) p+=b[i];
else q-=b[i];
cout<<max(p,q)<<endl;
cout<<abs(p-q)+1<<endl;
return 0;
}