Given two arrays of n integers each, A and B, define the matrix C

with n lines and n columns by C[i][j]=A[i]+B[j], for 1<=i,j<=n.

Design an algorithm running in quadratic time that finds the submatrix of maximum sum of C.