@[philip2011](/user/620456)
这道题不必用递归,效率太低了,用贪心做就可以了(而且这道题的贪心策略极为简单)
贪心算法の代码:
```cpp
#include<iostream>
using namespace std;
int h[100010];
int main(){
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
if (h[i] > h[i - 1]) {
ans += h[i] - h[i - 1];
}
}
cout << ans;
return 0;
}
```
by TPJ_XiaoJing @ 2024-03-13 16:52:41
@[TPJ_XiaoJing](/user/1280061) 谢了
by philip2011 @ 2024-03-13 16:56:36