演算法›Ch3 動態規劃
第 17 題/共 40 題
◀ AL 17/40
17. Monge Array、Quadrangle Inequality、Matrix
#AL-03-017難Monge ArrayQuadrangle InequalityMatrix

(4%). An m×nm \times n array AA of real numbers is a Monge array if for any rows 1≤i<k≤m1 \le i < k \le m and any columns 1≤j<ℓ≤n1 \le j < \ell \le n, we always have

A[i,j]+A[k,ℓ]≤A[i,ℓ]+A[k,j]A[i,j] + A[k,\ell] \le A[i,\ell] + A[k,j]

(1)

In other words, for the four entries at rows i,ki,k and columns j,ℓj,\ell, the sum of the upper-left and lower-right elements is always at most the sum of the lower-left and upper-right elements. Consider the following two arrays

M1=[1017132823172216292324282234241113617745443237233633192167566515334]andM2=[37232232216710533430313213964321158]M_1 = \begin{bmatrix} 10 & 17 & 13 & 28 & 23 \\ 17 & 22 & 16 & 29 & 23 \\ 24 & 28 & 22 & 34 & 24 \\ 11 & 13 & 6 & 17 & 7 \\ 45 & 44 & 32 & 37 & 23 \\ 36 & 33 & 19 & 21 & 6 \\ 75 & 66 & 51 & 53 & 34 \end{bmatrix} \quad \text{and} \quad M_2 = \begin{bmatrix} 37 & 23 & 22 & 32 \\ 21 & 6 & 7 & 10 \\ 53 & 34 & 30 & 31 \\ 32 & 13 & 9 & 6 \\ 43 & 21 & 15 & 8 \end{bmatrix}

It can be verified that M1M_1 is a Monge array and M2M_2 is not. Which of the followings are true?

📄 交大114
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
本章題號 · 1–20 / 40