买了一台cvs的netbook# PennySaver - 省钱一族
l*r
1 楼
Given an n x n matrix A(i,j) of integers, find maximum value A(c,d) - A(a,b)
over all choices of indexes such that both c > a and d > b.
Required complexity: O(n^2)
原题在,可是没有解答。
http://www.careercup.com/question?id=5818131813498880
有大牛看看吗?
over all choices of indexes such that both c > a and d > b.
Required complexity: O(n^2)
原题在,可是没有解答。
http://www.careercup.com/question?id=5818131813498880
有大牛看看吗?