题意:一些花瓶,每个人有一个花,可以插在任意花瓶,每个人的花插进去会有一个值,然后n个人,第i个人插的花瓶必须在第i + 1个人的左边,问能获得的最大值(没插的花瓶值为0)
思路:dp[i][j]表示第i个人,插了第j个花瓶的最大值,dp[i][j]表示第i个人,插j个位置的最大值,那么dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 105;
const int INF = 0x3f3f3f3f;
int f, v, a[N][N], dp[N][N];
int main() {
while (~scanf("%d%d", &f, &v)) {
for (int i = 1; i <= f; i++)
for (int j = 1; j <= v; j++)
scanf("%d", &a[i][j]);
int ans = -INF;
for (int i = 1; i <= f; i++) {
for (int j = i; j <= v - (f - i); j++) {
dp[i][j] = -INF;
for (int k = i - 1; k < j; k++)
dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
if (i == f) ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
}
return 0;
}