[蓝桥杯练习]9.最大子矩阵

#include<bits/stdc++.h>
using namespace std;
int arr[20][20]={
{6,9,8,5,9,2,4,1,8,3,9,3,8,7,8,6,8,9,4,1},
{1,7,6,1,5,8,7,6,9,6,3,1,3,1,7,5,9,2,8,4},
{3,7,3,4,7,3,4,8,3,2,6,6,2,7,4,8,3,4,8,5},
{5,3,6,7,1,2,5,6,5,5,6,1,6,7,8,6,4,7,4,3},
{1,6,1,2,1,6,8,6,9,2,7,4,3,2,3,2,9,4,7,9},
{1,3,5,4,7,4,1,3,3,4,9,9,6,2,7,7,3,4,4,7},
{2,7,9,7,9,9,4,5,9,2,9,8,4,8,8,2,4,6,8,7},
{5,3,7,7,6,9,8,3,3,4,6,8,3,8,7,9,1,3,7,9},
{5,6,4,9,3,4,2,1,3,6,5,3,6,5,7,1,7,7,4,5},
{2,1,9,2,4,3,7,9,2,9,3,8,7,2,6,1,1,3,8,2},
{9,3,9,1,9,3,5,3,2,1,6,2,4,3,5,6,1,2,7,7},
{5,4,2,9,6,1,4,4,7,6,3,9,6,9,2,5,7,7,8,8},
{9,6,2,3,3,9,7,2,5,1,3,7,9,4,7,3,2,9,3,3},
{8,1,4,4,3,4,9,4,5,3,3,1,2,9,9,3,9,9,7,5},
{6,1,1,7,1,8,8,2,9,8,8,8,7,7,5,9,3,4,9,9},
{6,1,2,1,6,8,6,8,8,9,5,7,2,1,3,4,8,5,2,2},
{5,5,4,8,5,3,4,5,9,5,9,2,9,4,7,2,6,8,9,6},
{3,2,1,2,4,9,6,3,3,1,8,2,4,2,5,5,4,9,2,2},
{1,3,5,9,3,6,4,7,1,9,1,9,3,4,2,7,2,6,9,6},
{5,6,4,3,6,8,9,5,9,4,4,9,1,9,8,9,9,2,4,6}};
int main(){
int n=20,k=5;
int presum[n][n];//1阶前缀和矩阵, 
//int presumk[n-k+1][n-k+1];//k阶前缀和矩阵,本题不用 
presum[0][0]=arr[0][0];//初始化最左上角前缀和(唯一一个前缀和等于原值的位置)

//建立1阶前缀和矩阵的首行首列,变式一维前缀和公式:presum[i]=arr[i]+presum[i-1];
for(int i=1;i<n;++i)presum[0][i]=arr[0][i]+presum[0][i-1];
for(int i=1;i<n;++i)presum[i][0]=arr[i][0]+presum[i-1][0];
//建立1阶前缀和矩阵表 presum[i][j]=presum[i-1][j]+presum[i][j-1]-presum[i-1][j-1]+arr[i][j]
for(int i=1;i<n;++i)for(int j=1;j<n;++j)presum[i][j]=presum[i-1][j]+presum[i][j-1]-presum[i-1][j-1]+arr[i][j];
//定义k阶矩阵最大值 
int maxnum=INT_MIN;
//依次比较所有的k阶矩阵,但不用k阶矩阵表,而是利用1阶矩阵表 
for(int i=k-1;i<=n-k;++i)for(int j=k-1;j<=n-k;++j){
	//k阶前缀表的前k-1行列不用管(等于1阶的k-1行列),但是第k行列开始就得开始记录了,因为我们记录第k行列,故是[k-1][k-1]
	//最后一个能取到k阶矩阵的行列为n-k+1,即[n-k]
	int temp=presum[i+k-1][j+k-1]-presum[i-1][j+k-1]-presum[i+k-1][j-1]+presum[i-1][j-1];
	//当前点行列[x]为左上角的k阶矩阵的右下角行列为[x+k-1](其中x也作为一行,抵消掉k里面的一行故需要减出来) 
	//当前点为左上角的k阶矩阵其右下角点代表了[0]->[x]的和
	//减去以当前点上方点,左边点为右下角的矩阵,则多减取了以西北方邻点为右下角的区域,需要加回来 
	maxnum=temp>maxnum?temp:maxnum;
	//取出二维前缀和的差,得到值,按需求进行保留 
}
cout<<maxnum;
return 0;
}