最小步骤收集硬币 分治 递归

#include <bits/stdc++.h>
using namespace std;
  
int minStepsRecur(int height[], int l, int r, int h)
{
    if (l >= r)
        return 0;
  
    int m = l;
    for (int i = l; i < r; i++)
        if (height[i] < height[m])
            m = i;
  
    return min(r - l,
               minStepsRecur(height, l, m, height[m]) + 
               minStepsRecur(height, m + 1, r, height[m]) + 
               height[m] - h);
}
  
int minSteps(int height[], int N)
{
    return minStepsRecur(height, 0, N, 0);
}
  
int main()
{
    int N = 0;
    
    cin >> N;
    int *height = new int[N];
    for(int i = 0; i < N; i++)
    {
        cin >> height[i];
    }
  
    cout << minSteps(height, N) << endl;
    return 0;
}