洛谷 #1969. 积木大赛

版权声明：转载请注明出处 https://blog.csdn.net/qq_41593522/article/details/84501910

题意

选择任意l~r区间+1，问达到目标状态所需最小步数

题解

模拟即可

调试记录

无

#include <cstdio>

using namespace std;

int pre, a, ans, n;

int main(){
    scanf("%d", &n);
    scanf("%d", &ans); pre = ans;
    
    for (int i = 2; i <= n; i++){
        scanf("%d", &a);
        if (a > pre) ans += (a - pre);
        pre = a;
    }
    printf("%d\n", ans);
    
    return 0;
}