【TOJ 2211】Copying Books【DP】

来源：互联网发布：招聘游戏程序员编辑：程序博客网时间：2024/05/29 17:54

题意：给出n个数字，将其分成m连续块，使得连续和最大的最小。

思路：DP[i][j]表示前i个数字被分成j个的最优值。

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;#define N 510ll val[N], sum[N];ll dp[N][N];int ans[N];int main() {int T, n, m, i, j, k;scanf("%d", &T);while (T--) {scanf("%d%d", &n, &m);sum[0] = 0;for (i = 1;i <= n;i++) {scanf("%lld", &val[i]);sum[i] = sum[i-1]+val[i];}memset(dp, -1, sizeof(dp));dp[0][0] = 0;for (i = 1;i <= n;i++) dp[i][1] = sum[i];for (i = 1;i <= n;i++) {for (j = 2;j <= i && j <= m;j++) {for (k = j-1;k < i;k++) {                    int tm = max(dp[k][j-1], sum[i]-sum[k]);                    if (dp[i][j] == -1 || dp[i][j] > tm) dp[i][j] = tm;}}}ll x = 0;j = m-1;        for (i = n;i >= 1;i--) {            x += val[i];            if (x > dp[n][m] || i <= j) {                ans[j--] = i+1;                x = val[i];            }        }        j = 1;for (i = 1;i < n;i++) {            printf("%d ", val[i]);            if (j < m && ans[j] == i+1) {                j++;                printf("/ ");            }}printf("%d\n", val[n]);}}

0 0