Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

用动态规划怎么做啊?

Posted by gaoteng1984 at 2007-08-01 19:56:41 on Problem 1050 
我是先求的sum[i][j] = Sum{All value in Matrix((0,0), (i,j))}, 然后再用4重循环定每个矩形的左上角和右下角,即sumMax[i][j] = Max{sum[i][j] - sum[iSmall][j] - sum[i][jSmall] + sum[iSmall][jSmall]} (for each iSmall < i && jSmall < j). 是O(N^4)的.
用动态规划怎么做啊,请教各位牛人...
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator