说明：  最大长方体问题 一个长，宽，高分别为m,n,p 的长方体被分割成个m*n*p 个小立方体。每个小立方体内有一个整数。试设计一个算法，计算出所给长方体的最大子长方体。子长方体的大小由它所含所有整数之和确定。
(The biggest problem Cuboid a length, width and height, respectively m, n, p of the rectangular cut into m* n* p a small cube. Each cube, there are a whole number. Try to design an algorithm to calculate the largest sub-rectangular cuboid. The size of sub-rectangular by it contains all the integral and defined.)