机器分配(assigned) 题解

题目在主页，如有出错请指出

include <bits/stdc++.h>

using namespace std;

int a[15][25], f[15][25];

void dg(int dep, int max, int rest)
{
if (dep == 0) return;
int i;
for (i = 0;i <= rest;i++)
if (max == f[dep - 1][i] + a[dep][rest - i]) break;
dg(dep - 1,f[dep - 1][i], i);
cout << dep << ' ' << rest - i << endl;
}

int main()
{
int n, m;
cin >> n >> m;
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
cin >> a[i][j];
memset(f, 0, sizeof f);
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
for (int k = 0;k <= j;k++)
f[i][j] = max(f[i][j], f[i - 1][k] + a[i][j - k]);
cout << f[n][m] << endl;
dg(n, f[n][m], m);
return 0;
}