CF 448C Painting Fence

分治。最大值为n个篱笆都竖着涂。如果出现横着涂的情况则高度最小的篱笆必然横着涂。将涂过的高度减去。又成为了最初的情况。递归即可。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
int n;
int a[5005];
int cal(int l, int r){
    int ans = r - l + 1;
    int sum = 0;
    int mv = a[l];
    for(int i = l; i <= r; i++){
        if(a[i] < mv)mv = a[i];
    }
    sum = mv;
    if(mv >= ans)return ans;
    for(int i = l; i <= r; i++)
        a[i] -= mv;
    int pre;
    int f = 0;
    for(int i = l; i <= r; i++){
        if(f == 0){
            if(a[i] != 0){
                if(i == r)sum += 1;
                else {
                    pre = i;
                    f = 1;
                }
            }
        }
        else {
            if(a[i] == 0){
                sum += cal(pre, i - 1);
                f = 0;
            }
            else if(i == r){
                sum += cal(pre, i);
            }
        }
    }
    return min(sum, ans);
}
int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    int ans = cal(0, n - 1);
    printf("%d\n", ans);
    return 0;
}