Codeforces 360B Levko and Array

刷了好多DP了...结果还是想不到怎么做...

二分beauty值，判断合法时dp[i]表示从i+1到n-1需要的最小变换次数，则当abs(a[i]-a[j]) < beauty*(i-j)时, dp[i] = min(dp[j]+j-i-1)

代码：

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 2e3+5;
int n, k, dp[N], a[N];

bool check(ll m) {
    if(m < 0) return false;
    for(int i = n-1; i >= 0; i--) {
        dp[i] = n-i-1;
        for(int j = i+1; j < n; j++) {
            if((ll)abs(a[j]-a[i]) <= m*(ll)(j-i)) dp[i] = min(dp[i], dp[j]+j-i-1);
        }
        if(dp[i]+i <= k) return true;
    }
    return false;
}

int main() {
    scanf("%d%d", &n, &k);
    for(int i = 0; i < n; i++) scanf("%d", &a[i]);
    ll l = 0, r = 2e9;
    while(l < r) {
        int m = (l+r)>>1;
        if(check(m)) r = m;
        else l = m+1;
    }
    printf("%lld\n", r);
    return 0;
}