HBC16634transform题解

云中君 算法基础篇 50 0
想要检验自己的编程水平?来试试全网最全C++题库,让您在挑战中不断进步。
White Cloud placed n containers in sequence on a axes. The i-th container is located at x[i] and there are a[i] number of products in it. White Rabbit wants to buy some products. The products which are required to be sold must be placed in the same container. The cost of moving a product from container u to container v is 2*abs. White Cloud wants to know the maximum number of products it can sell. The total cost can't exceed T.

White Cloud placed n containers in sequence on a axes. The i-th container is located at x[i] and there are a[i] number of products in it. White Rabbit wants to buy some products. The products which are required to be sold must be placed in the same container. The cost of moving a product from container u to container v is 2*abs(x[u]-x[v]). White Cloud wants to know the maximum number of products it can sell. The total cost can't exceed T.

HBC16634transform题解
-第1张图片-东莞河马信息技术
(图片来源网络,侵删)
不断学习,不断挑战,才能在编程领域中脱颖而出!全网最全C++题库,助您成为编程高手!

标签: HBC16634transform题解