Acwing-100-IncDec搴忓垪(宸垎)

Posted 2020-11-12

鏍囩锛?a href='http://www.mamicode.com/so/1/%e4%b8%8b%e6%a0%87' title='涓嬫爣'>涓嬫爣   code   typedef   its   閫夋嫨   names   space   abs   print   

閾炬帴:

https://www.acwing.com/problem/content/102/

棰樻剰:

缁欏畾涓€涓暱搴︿负 n 鐨勬暟鍒?a1,a2,鈥?an锛屾瘡娆″彲浠ラ€夋嫨涓€涓尯闂?[l,r]锛屼娇涓嬫爣鍦ㄨ繖涓尯闂村唴鐨勬暟閮藉姞涓€鎴栬€呴兘鍑忎竴銆?/p>

姹傝嚦灏戦渶瑕佸灏戞鎿嶄綔鎵嶈兘浣挎暟鍒椾腑鐨勬墍鏈夋暟閮戒竴鏍凤紝骞舵眰鍑哄湪淇濊瘉鏈€灏戞鏁扮殑鍓嶆彁涓嬶紝鏈€缁堝緱鍒扮殑鏁板垪鍙兘鏈夊灏戠銆?/p>

鎬濊矾:

灏辨槸灏嗘煡鍒嗘暟缁勯櫎浜嗙涓€浣嶉兘缃负0, 鐨勬搷浣滄鏁?鍥犱负姣忔鍙兘鍔?鎴栧噺涓€.鍙互浼樺厛閰嶅涓€姝ｄ互鍋惰礋,鍐嶅鍓╀綑鐨勫€艰繘琛屽鐞?

浠ｇ爜:

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int MAXN = 1e5+10;
int a[MAXN], Sub[MAXN];
int n;

int main()
{
    LL ne = 0, po = 0;
    scanf("%d", &n);
    for (int i = 1;i <= n;i++)
    {
        scanf("%d", &a[i]);
        Sub[i] = a[i]-a[i-1];
        if (i <= 1)
            continue;
        if (Sub[i] > 0)
            po += Sub[i];
        else
            ne += abs(Sub[i]);
    }
    LL oth = abs(po-ne);
    printf("%lld
%lld
", max(ne, po), oth+1);

    return 0;
}