hdu笔试2016-04数字矩阵

最新推荐文章于 2024-06-01 23:14:10 发布

NTNNSgr

最新推荐文章于 2024-06-01 23:14:10 发布

阅读量33

点赞数

文章标签：矩阵算法 c++ Powered by 金山文档

本文链接：https://blog.csdn.net/weixin_51001978/article/details/129641718

版权

//2016-04  其实没太看懂题os
#include <iostream>

using namespace std;

const int p = 50;
int b[p][p], s[p][p];
int mine = -1;
int sum = 0;
int a = 0;
int minx[p], miny[p];
int x[4] = { 0,1,0,0 }, y[4] = { 0,1,0,1 };

int main()
{
    int N, M, n, m;
    cin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= M; j++)
            cin >> b[i][j];
    }
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
            cin >> s[i][j];
    }
    for (int i = 1; i <= N-n; i++)
    {
        for (int j = 1; j <= M-m; j++)
        {
            for (int k = 0; k < 4; k++)
            {
                sum += abs(s[1 + x[k]][1 + y[k]] - b[i + x[k]][j + y[k]]);
            }
            if (sum <= mine || (i == 1 && j == 1))
            {
                mine=sum;
                minx[a++] = i;
                miny[a++] = j;
            }
        }
    }
    cout << mine << endl;
    for (int i = 0; i < a; i++)
        cout << '(' << minx[i] << ',' << miny[i] << ')' << endl;
    return 0;
}