关于本题一些思考

// 2025/12/19
// Author: Forever
#include <bits/stdc++.h>
#define int long long
using namespace std;

int n, k, r[201], pre[201], sum[201], dp[101][9];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> r[i], r[i + n] = r[i];
    reverse(r + 1, r + n * 2 + 1);
    for (int i = 1; i <= n * 2; i++)
        sum[i] = sum[i - 1] + r[i], pre[i] = pre[i - 1] + r[i] * i;
    int ans = 0x3f3f3f3f3f3f3f3f;
    for (int h = 0; h < n; h++){
        memset(dp, 0x3f, sizeof(dp));
        dp[0][0] = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= k; j++)
                for (int p = 0; p < i; p++)
                    dp[i][j] = min(dp[i][j], dp[p][j - 1] + (sum[i - 1 + h] - sum[p + h]) * (i + h) - (pre[i - 1 + h] - pre[p + h]));
        ans = min(ans, dp[n][k]);
    }
    cout << ans << endl;
    return 0;
}