C++ 解法, 执行用时: 10ms, 内存消耗: 1256KB, 提交时间: 2020-10-31

/*我是萌新*/
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include <iomanip>
#include<map>
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//fixed<< setprecision(2)
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    ll n;
    cin >> n;
    ll a[100005];
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    ll x = 0, y = 0, flag = 0;
    for (ll i = 1; i < n; i++)
    {
        if (a[i] > a[i - 1])
        {
            x+=(a[i]-a[i-1]);
            if(!flag)y++;
            flag=1;
        }
        else if(a[i]<a[i-1])
        {
            y+=flag;
            flag=0;
        }
    }
   y+=flag;
    cout << x << " " << y << '\n';
}

C++ 解法, 执行用时: 11ms, 内存消耗: 2176KB, 提交时间: 2020-08-25

/*我是萌新*/
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include <iomanip>
#include<map>
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
//ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
//ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//fixed<< setprecision(2)
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    ll n;
    cin >> n;
    ll a[100005];
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    ll x = 0, y = 0, flag = 0;
    for (ll i = 1; i < n; i++)
    {
        if (a[i] > a[i - 1])
        {
            x+=(a[i]-a[i-1]);
            if(!flag)y++;
            flag=1;
        }
        else if(a[i]<a[i-1])
        {
            y+=flag;
            flag=0;
        }
    }
   y+=flag;
    cout << x << " " << y << '\n';
}