题目1492：最小子矩阵

来源：互联网发布：ubuntu中mysql安装依赖编辑：程序博客网时间：2024/06/05 15:27

#include<iostream>#include<vector>#include <algorithm>#include<stdio.h>#include<string>#include<queue>using namespace std;const int MAX=100; int main(){    int m,n;    while(cin>>m>>n)    {        int a[MAX][MAX];        for(int i=0;i<m;i++)            for(int j=0;j<m;j++)                cin>>a[i][j];        int min=11000000;        for(int i=0;i<=m-n;i++)        {            for(int j=0;j<=m-n;j++)            {                int sum=0;                for(int l=i;l<=i+n-1;l++)                    for(int r=j;r<=j+n-1;r++)                        sum+=a[l][r];                if(sum<min)                    min=sum;            }        }        cout<<min<<endl;    }    return 0;} /**************************************************************    Problem: 1492    User: cust123    Language: C++    Result: Accepted    Time:90 ms    Memory:1520 kb****************************************************************/

0 0