1177: [Apio2009]Oil
Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 1752 Solved: 713
[ Submit][ Status][ Discuss]
Description
采油区域 Siruseri政府决定将石油资源丰富的Navalur省的土地拍卖给私人承包商以建立油井。被拍卖的整块土地为一个矩形区域,被划分为M×N个小块。 Siruseri地质调查局有关于Navalur土地石油储量的估测数据。这些数据表示为M×N个非负整数,即对每一小块土地石油储量的估计值。 为了避免出现垄断,政府规定每一个承包商只能承包一个由K×K块相连的土地构成的正方形区域。 AoE石油联合公司由三个承包商组成,他们想选择三块互不相交的K×K的区域使得总的收益最大。 例如,假设石油储量的估计值如下: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 8 8 8 8 8 1 1 1 1 8 8 8 8 8 1 1 1 1 8 8 8 8 8 1 1 1 1 1 1 1 8 8 8 1 1 1 1 1 1 1 1 8 8 8 1 1 1 1 1 1 9 9 9 1 1 1 1 1 1 9 9 9 如果K = 2, AoE公司可以承包的区域的石油储量总和为100, 如果K = 3, AoE公司可以承包的区域的石油储量总和为208。 AoE公司雇佣你来写一个程序,帮助计算出他们可以承包的区域的石油储量之和的最大值。
Input
输入第一行包含三个整数M, N, K,其中M和N是矩形区域的行数和列数,K是每一个承包商承包的正方形的大小(边长的块数)。接下来M行,每行有N个非负整数表示这一行每一小块土地的石油储量的估计值
Output
输出只包含一个整数,表示AoE公司可以承包的区域的石油储量之和的最大值。
Sample Input
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 8 8 8 8 8 1 1 1
1 8 8 8 8 8 1 1 1
1 8 8 8 8 8 1 1 1
1 1 1 1 8 8 8 1 1
1 1 1 1 1 1 8 8 8
1 1 1 1 1 1 9 9 9
1 1 1 1 1 1 9 9 9
Sample Output
HINT
Source
#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<bitset>
#include<algorithm>
#include<cstring>
#include<map>
#include<stack>
#include<set>
#include<cmath>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
const int maxn = 2E3 + 10;
int n,m,k,a[maxn][maxn],b[maxn][maxn],c[maxn][maxn],d[maxn][maxn],t[maxn][maxn],
ans,sum[maxn][maxn],e[maxn][maxn],f[maxn][maxn],A[maxn],B[maxn];
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m ;j++) {
scanf("%d",&sum[i][j]);
sum[i][j] += (sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
int x,y;
x = i - k + 1;
y = j - k + 1;
if (x > 0 && y > 0)
a[i][j] = sum[i][j] - sum[x-1][j] - sum[i][y-1] + sum[x-1][y-1];
x = i - k + 1;
y = j + k - 1;
if (x > 0 && y <= m)
b[i][j] = sum[i][y] - sum[x-1][y] - sum[i][j-1] + sum[x-1][j-1];
x = i + k - 1;
y = j - k + 1;
if (x <= n && y > 0)
c[i][j] = sum[x][j] - sum[i-1][j] - sum[x][y-1] + sum[i-1][y-1];
x = i + k - 1;
y = j + k - 1;
if (x <= n && y <= m) {
d[i][j] = sum[x][y] - sum[i-1][y] - sum[x][j-1] + sum[i-1][j-1];
t[i][j] = d[i][j];
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
a[i][j] = max(a[i][j],max(a[i-1][j],a[i][j-1]));
for (int i = 1; i <= n; i++)
for (int j = m; j; j--)
b[i][j] = max(b[i][j],max(b[i-1][j],b[i][j+1]));
for (int i = n; i; i--)
for (int j = 1; j <= m; j++)
c[i][j] = max(c[i][j],max(c[i+1][j],c[i][j-1]));
for (int i = n; i; i--)
for (int j = m; j; j--)
d[i][j] = max(d[i][j],max(d[i+1][j],d[i][j+1]));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
A[i] = max(A[i],t[i][j]);
for (int j = 1; j <= m; j++)
for (int i = 1; i <= n; i++)
B[j] = max(B[j],t[i][j]);
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++) {
if (j - k + 1 < i) continue;
e[i][j] = max(e[i][j-1],A[j-k+1]);
}
for (int i = 1; i <= m; i++)
for (int j = i; j <= m; j++) {
if (j - k + 1 < i) continue;
f[i][j] = max(f[i][j-1],B[j-k+1]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
ans = max(ans,a[i][j] + b[i][j+1] + c[i+1][m]);
ans = max(ans,c[i][j] + d[i][j+1] + a[i-1][m]);
ans = max(ans,a[i][j] + c[i+1][j] + b[n][j+1]);
ans = max(ans,b[i][j] + d[i+1][j] + a[n][j-1]);
}
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i >= k && j - i >= k && n - j >= k)
ans = max(ans,e[1][i] + e[i+1][j] + e[j+1][n]);
for (int i = 1; i <= m; i++)
for (int j = i + 1; j <= m; j++)
if (i >= k && j - i >= k && n - j >= k)
ans = max(ans,f[1][i] + f[i+1][j] + f[j+1][m]);
cout << ans;
return 0;
}