题意:给你一个n*m的矩阵,然后问你螺旋线能够覆盖的最大和是多少
思路:
暴力记忆化搜索,滚动数组优化
dp[i][j][len]表示以i,j为起点,正方形边长为len的覆盖的值是多少
dp[i][j][len]显然等于len所在的正方形覆盖的和 - mp[i+1][j] - dp[i+1][j+1][len-2]
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
int n,m;
int mapp[510][510];
int sum[510][510];
int vis[510][510];
int dp[510][510][2];
int cal(int x1,int y1,int x2,int y2)
{
return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}
int solve(int x,int y,int len)
{
if (len==0)
{
dp[x][y][0]=mapp[x][y];
return dp[x][y][0];
}
else
{
dp[x][y][0]=cal(x,y,x+len,y+len);
dp[x][y][0]-=mapp[x+1][y];
dp[x][y][0]-=dp[x+1][y+1][1];
return dp[x][y][0];
}
}
int main()
{
scanf("%d%d",&n,&m);
for (int i = 1;i<=n;i++)
for (int j = 1;j<=m;j++)
scanf("%d",&mapp[i][j]);
for (int i = 1;i<=n;i++)
for (int j = 1;j<=m;j++)
sum[i][j]=mapp[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
int ans = -INF;
for (int k = 0;k<=min(n,m);k+=2)
{
memset(vis,0,sizeof(vis));
for (int i = n;i>=1;i--)
for (int j = m;j>=1;j--)
dp[i][j][1]=dp[i][j][0];
for (int i = n;i>=1;i--)
{
if (i+k>n)
continue;
for (int j = m;j>=1;j--)
{
if (j+k>m)
continue;
int p = solve(i,j,k);
if (k>0)
ans = max(ans,p);
}
}
}
printf("%d\n",ans);
}