最大长方体问题 一个长，宽，高分别为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 ar

国外的基于MATLAB的分割算法，比较详细，有样图，需要的可以-Abroad, the segmentation algorithm based on MATLAB, more detailed, drawing, and we need to look at

自己写改进的经典算法，效果很好，可用于分割以及检测，精度高，效率高，可以直接执行，有简单的注释，可以作为算法的比较等，-Write your own improved classical algorithm works well and can be used segmentation and detection, high precision, high efficiency, can be executed directly, a simple note can be used as com