{"id":125113,"date":"2020-06-25T04:12:56","date_gmt":"2020-06-24T20:12:56","guid":{"rendered":"http:\/\/4563.org\/?p=125113"},"modified":"2020-06-25T04:12:56","modified_gmt":"2020-06-24T20:12:56","slug":"leetcode-lintcode-%e9%a2%98%e8%a7%a3-%e6%94%be%e5%b0%8f%e7%90%83%e9%97%ae%e9%a2%98","status":"publish","type":"post","link":"http:\/\/4563.org\/?p=125113","title":{"rendered":"[leetcode\/lintcode \u9898\u89e3] \u653e\u5c0f\u7403\u95ee\u9898"},"content":{"rendered":"<div>\n<div>\n<div>\n<h1>                  [leetcode\/lintcode \u9898\u89e3] \u653e\u5c0f\u7403\u95ee\u9898               <\/h1>\n<p> <\/p>\n<div>\n<div> <span>\u8cc7\u6df1\u5927\u4f6c : hakunamatata11 <\/span>  <span><i><\/i> 10<\/span> <\/div>\n<div> <\/div>\n<\/p><\/div>\n<\/p><\/div>\n<\/p><\/div>\n<div isfirst=\"1\"> <\/p>\n<p>n \u4e2a\u6876\u4e2d\u5c0f\u7403\u7684\u4e2a\u6570\u5df2\u77e5,\u53ef\u4ee5\u64cd\u4f5c k \u6b21(\u6bcf\u6b21\u4ece\u6876\u4e2d\u53d6\u51fa\u4e00\u4e2a\u7403,\u6216\u8005\u6dfb\u52a0\u4e00\u4e2a\u7403),\u6bcf\u4e2a\u6876\u6709\u89c4\u5b9a\u7684\u6700\u5927\u5bb9\u91cf W[i]\u3002\u6c42\u64cd\u4f5c\u540e\u4e24\u76f8\u90bb\u6876\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c\u7684\u5e73\u65b9\u7684\u6700\u5c0f\u503c\u3002<\/p>\n<p>\u5728\u7ebf\u8bc4\u6d4b\u5730\u5740: https:\/\/www.lintcode.com\/problem\/put-small-balls\/?utm_source=sc-v2ex-fks<\/p>\n<p>\u6837\u4f8b 1:<\/p>\n<pre><code>\u8f93\u5165:  5 6 [1,2,3,4,5] [15,15,15,15,15] \u8f93\u51fa:  0 <\/code><\/pre>\n<p>\u8bf4\u660e:<\/p>\n<p>\u5171\u6709 5 \u4e2a\u6876\uff0c\u6700\u591a\u64cd\u4f5c 6 \u6b21\uff0c\u6876\u5185\u7684\u5c0f\u7403\u5206\u522b\u662f 1,2,3,4,5\uff0c\u6876\u7684\u6700\u5927\u5bb9\u91cf\u5206\u522b\u662f 15,15,15,15,15 \u3002<\/p>\n<p>[\u9898\u89e3] \u4e8c\u5206\u6700\u5927\u5dee\u503c target\uff0c\u5224\u65ad\u6700\u5927\u5dee\u503c\u4e3a target \u65f6\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570\u662f\u5426\u5c0f\u4e8e\u7b49\u4e8e\u6700\u591a\u64cd\u4f5c\u6b21\u6570 k \u3002 \u5982\u679c\u6700\u5c0f\u53d8\u52a8\u7403\u6570\u5c0f\u4e8e\u7b49\u4e8e k\uff0c\u90a3\u4e48\u8bf4\u660e\u53ef\u884c\uff0c\u7ee7\u7eed\u641c\u5bfb\u66f4\u5c0f\u7684\u5dee\u503c;\u5426\u5219\u641c\u5bfb\u66f4\u5927\u7684\u5dee\u503c\u3002<\/p>\n<p>\u8ba1\u7b97\u6700\u5927\u5dee\u503c\u4e3a target \u65f6\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570\uff1a \u5bf9\u4e8e\u6570\u7ec4 A[]\u7684\u6bcf\u4e00\u4e2a\u6876\u5185\u5c0f\u7403\u6570\u76ee\uff0c\u6211\u4eec\u90fd\u9700\u8981\u8fdb\u884c[1,W[i]]\u8303\u56f4\u5185\u7684\u53ef\u80fd\u72b6\u6001\u7684\u8f6c\u79fb\u3002 \u4ee4 dp[i][j]\u8868\u793a A[i]=j \u65f6\uff0cA[i]\u4e0e A[i-1]\u5dee\u503c\u4e0d\u5927\u4e8e target \u6240\u9700\u8981\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570\u3002 \u5f53 A[i]=j \u65f6\uff0c\u53ef\u884c\u7684 A[i-1]\u7684\u8303\u56f4\u4e3a[max(0, j &#8211; target)\uff0cmin(W[i &#8211; 1], j + target)]\u3002 \u5f53 A[i]=j\uff0ck \u5728[max(1, j &#8211; target)\uff0cmin(100, j + target)]\u8303\u56f4\u5185\u65f6\uff0c\u6211\u4eec\u53ef\u4ee5\u5199\u51fa\u4ee5\u4e0b\u5f0f\u5b50\uff1a<\/p>\n<p>\u4e34\u754c\u503c\uff1a dp[0][j] = abs(j &#8211; A[0])<\/p>\n<p>\u72b6\u6001\u8f6c\u79fb\u65b9\u7a0b\uff1a dp[i][j] = min(dp[i][j], dp[i &#8211; 1][k] + abs(j &#8211; A[i]))<\/p>\n<p>\u6700\u540e\u5728\u6240\u6709\u6700\u540e\u4e00\u4f4d\u7684\u53ef\u80fd\u89e3 dp[n-1][?]\u4e2d\u7684\u6700\u5c0f\u503c\u5c31\u662f\u6211\u4eec\u6c42\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570\u3002<\/p>\n<pre><code>class Solution:     \"\"\"     @param n: the number of buckets     @param k: the maximum times of operations     @param A: the number of balls in each bucket     @param W: the maximum capacity of each bucket     @return: return the minimum square value of the maximum difference     \"\"\"     # \u8ba1\u7b97\u5f53\u76f8\u90bb\u5dee\u503c\u6700\u5927\u4e3a target \u65f6\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570     def min_cost(self, n, A, W, target):         # dp[i][j]\u8868\u793a\u5143\u7d20 A[i]=j \u65f6\uff0cA[i]\u4e0e A[i-1]\u5dee\u503c\u4e0d\u5927\u4e8e target \u6240\u9700\u8981\u7684\u6700\u5c0f\u53d8\u52a8\u7403\u6570         # \u521d\u59cb\u5316\u4e3a\u6781\u5927\u503c         dp = [[1000000000] * 101 for _ in range(n)]         for i in range(n):             for j in range(W[i] + 1):                 if i == 0:                     # \u4e34\u754c\u503c\uff1a\u7b2c\u4e00\u4e2a\u5143\u7d20 A[0]\u8c03\u6574\u4e3a j \u7684\u53d8\u52a8\u7403\u6570                     dp[0][j] = abs(j - A[0])                 else:                     # left \u4e3a A[i]=j \u65f6\uff0cA[i-1]\u4e0e A[i]\u5dee\u503c\u4e0d\u5927\u4e8e target \u7684 A[i-1]\u6700\u5c0f\u503c                     # right \u4e3a A[i]=j \u65f6\uff0cA[i-1]\u4e0e A[i]\u5dee\u503c\u4e0d\u5927\u4e8e target \u7684 A[i-1]\u6700\u5927\u503c                     left = max(0, j - target)                     right = min(W[i - 1], j + target)                     for k in range(left, right + 1):                         # \u5f53 A[i-1]=k \u65f6\uff0c\u7b54\u6848\u4e3a A[i-1]=k \u7684\u4ee3\u4ef7 dp[i-1][k]\uff0c\u52a0\u4e0a A[i]=j \u7684\u8c03\u6574\u4ee3\u4ef7 abs(j-A[i])                         dp[i][j] = min(dp[i][j], dp[i - 1][k] + abs(j - A[i]))         mincost = 1000000000         for i in dp[n - 1]:             mincost = min(mincost, i)         return mincost              def getAns(self, n, k, A, W):         ans = 1000000000         left, right = 0, 100         # \u4e8c\u5206\u6700\u5927\u5dee\u503c\uff0c\u7528 minCost \u8ba1\u7b97\u6700\u5c0f\u53d8\u52a8\u7403\u6570         # \u5982\u679c\u6700\u5c0f\u53d8\u52a8\u7403\u6570\u5c0f\u4e8e\u7b49\u4e8e k\uff0c\u90a3\u4e48\u8bf4\u660e\u53ef\u884c\uff0c\u7ee7\u7eed\u641c\u5bfb\u66f4\u5c0f\u7684\u5dee\u503c         # \u5426\u5219\u641c\u5bfb\u66f4\u5927\u7684\u5dee\u503c         while left + 1 &lt; right:             mid = left + (right - left) \/\/ 2             if self.min_cost(n, A, W, mid) &lt;= k:                 ans = min(ans, mid)                 right = mid             else:                 left = mid         if self.min_cost(n, A, W, left) &lt;= k:             ans = min(ans, left)         if self.min_cost(n, A, W, right) &lt;= k:             ans = min(ans, right)         return ans*ans <\/code><\/pre>\n<p>\u66f4\u591a\u8bed\u8a00\u4ee3\u7801\u53c2\u89c1\uff1ahttps:\/\/www.jiuzhang.com\/solution\/put-small-balls\/?utm_source=sc-v2ex-fks<\/p>\n<\/p><\/div>\n<div> <b>\u5927\u4f6c\u6709\u8a71\u8aaa<\/b> (<span>0<\/span>)        <\/div>\n<div> <\/div>\n<\/p><\/div>\n<\/p><\/div>\n<ul>\n<li>\n","protected":false},"excerpt":{"rendered":"<p>[leetcode\/lintcod&hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[],"tags":[],"_links":{"self":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts\/125113"}],"collection":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=125113"}],"version-history":[{"count":0,"href":"http:\/\/4563.org\/index.php?rest_route=\/wp\/v2\/posts\/125113\/revisions"}],"wp:attachment":[{"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=125113"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=125113"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/4563.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=125113"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}