Dynamic programming problem.Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. 

DP
..\DP
..\..\DP.cpp
..\..\DP.exe
..\..\DP.vcxproj
..\..\DP.vcxproj.filters
..\..\DP.vcxproj.user
..\..\ReadMe.txt
..\..\stdafx.cpp
..\..\stdafx.h
..\..\targetver.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．