20分,求解

P1969 [NOIP2013 提高组] 积木大赛

哪有这么简单
by Henry2012 @ 2023-08-08 12:03:11


挺简单的呀。。 ```c #include <iostream> using namespace std; int h[100010]; int main() { int n; cin >> n; int ans = 0; for (int i = 1; i <= n; i++) { cin >> h[i]; if (h[i] > h[i - 1]) { ans += h[i] - h[i - 1]; } } cout << ans << endl; return 0; } ```
by wzj0829 @ 2023-08-08 12:06:25


|