monge矩阵

#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int h, w, a[N][N];
int main(){
    cin >> h >> w;
    for(int i = 1; i <= h; i++) {
        for(int j = 1; j <= w; j++) {
            cin >> a[i][j];
        }
    }
    bool flag = 0;
    for(int i1 = 1; i1 < h; i1++)
        for(int i2 = i1+1; i2 <= h; i2++)
            for(int j1 = 1; j1 < w; j1++)
                for(int j2 = j1+1; j2 <= w; j2++)
                {
                    if(a[i1][j1]+a[i2][j2]>a[i1][j2]+a[i2][j1]) {
                        flag = 1;
                        goto out;
                    }

                }
out:
    cout << (flag?"No":"Yes");
    return 0;
}

上面这种方法的思路是:

根据monge矩阵的定义，暴力枚举每对(j1,j2,i1,i2)即可，O(n4)不会超时

#include<bits/stdc++.h>
using namespace std;
 
void calculate(double **A, int r1, int r2, int min, int max, int *f)	
{
	if (r1 > r2)return;
	int r = (r1 + r2) / 2;
	int result = min;
	int flag = A[r][min];
	for (int i = min + 1; i <= max; i++)	
	{
		if (A[r][i] < flag)
		{
			flag = A[r][i];
			result = i;
		}
	}
	f[r] = result;
	calculate(A, r1, r - 1, min, result, f);
	calculate(A, r + 1, r2, result, max, f);
}
 
bool isMonge(double **A, int m, int n)	
{
	for (int i = 0; i < m - 1; i++)for (int j = 0; j < n - 1; j++)if (A[i][j] + A[i + 1][j + 1]>A[i + 1][j] + A[i][j + 1])return false;
	return true;
}
int main()
{
	int m, n;
	while (cin >> m >> n && m>1 && n > 1)
	{
		double **A = new double*[m];	
		int *f = new int[m];	
		for (int i = 0; i < m; i++)
		{
			A[i] = new double[n];
			for (int j = 0; j < n; j++)cin >> A[i][j];
		}
		if (isMonge(A, m, n))
		{
			cout << "Yes";
			calculate(A, 0, m - 1, 0, n - 1, f);
			break;
		}
		else 
        {
            cout << "No";
            break;
        }
	}
	return 0;
}

这种方法就是calculate函数

monge矩阵定义:Ai1​,j1​​+Ai2​,j2​​≤Ai2​,j1​​+Ai1​,j2​​