算法
(暴力枚举) $O(H^2W^2)$
枚举不满足条件的情况即可
C++ 代码
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::vector;
int main() {
int h, w;
cin >> h >> w;
vector a(h, vector<int>(w));
rep(i, h)rep(j, w) cin >> a[i][j];
bool ok = true;
rep(i1, h)rep(i2, h)rep(j1, w)rep(j2, w) {
if (i1 < i2 and j1 < j2) {
if (a[i1][j1] + a[i2][j2] > a[i2][j1] + a[i1][j2]) {
ok = false;
break;
}
}
}
puts(ok ? "Yes" : "No");
return 0;
}