1084: [SCOI2005]最大子矩阵
Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 2715 Solved: 1350
[ Submit][ Status][ Discuss]
Description
这里有一个n*m的矩阵,请你选出其中k个子矩阵,使得这个k个子矩阵分值之和最大。注意:选出的k个子矩阵
不能相互重叠。
Input
第一行为n,m,k(1≤n≤100,1≤m≤2,1≤k≤10),接下来n行描述矩阵每行中的每个元素的分值(每个元素的
分值的绝对值不超过32767)。
Output
只有一行为k个子矩阵分值之和最大为多少。
Sample Input
3 2 2
1 -3
2 3
-2 3
1 -3
2 3
-2 3
Sample Output
9
HINT
Source
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn = 101;
const int INF = 32768;
int f[maxn][11],n,m,k,t,a[maxn][3],s[maxn] = {0},w[maxn][maxn][11],s1[maxn] = {0},s2[maxn] = {0};
int main()
{
scanf("%d%d%d",&n,&m,&t);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d",&a[i][j]);
if (m == 1)
{
for (int i = 1; i <= n; i++)
for (int k = 1; k <= t; k++)
f[i][k] = -INF;
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i][1];
for (int k = 1; k <= t; k++)
for (int i = 1; i <= n; i++)
{
f[i][k] = f[i - 1][k];
for (int j = 0; j <= i - 1; j++)
f[i][k] = max(f[i][k],f[j][k - 1] + s[i] - s[j]);
}
printf("%d",f[n][t]);
}
else
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= t; k++)
w[i][j][k] = -INF;
for (int i = 1; i <= n; i++) s1[i] = s1[i - 1] + a[i][1];
for (int i = 1; i <= n; i++) s2[i] = s2[i - 1] + a[i][2];
for (int k = 1; k <= t; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
w[i][j][k] = max(w[i - 1][j][k],w[i][j - 1][k]);
for (int l = 0; l <= i - 1; l++)
w[i][j][k] = max(w[i][j][k],w[l][j][k - 1] + s1[i] - s1[l]);
for (int l = 0; l <= j - 1; l++)
w[i][j][k] = max(w[i][j][k],w[i][l][k - 1] + s2[j] - s2[l]);
if (i == j)
for (int l = 0; l <= i - 1; l++)
w[i][j][k] = max(w[i][j][k],w[l][l][k - 1] + s1[i] - s1[l] + s2[j] - s2[l]);
}
printf("%d",w[n][n][t]);
}
return 0;
}