HBC17338Interval Revisited题解

为你而来永不停止 算法基础篇 178 0
想要检验自己的编程水平?来试试全网最全C++题库,让您在挑战中不断进步。
Chiaki has a long interval [1,m] and n small intervals [l1, r1], [l2,r2], ..., [ln, rn]. Each small interval [li,ri] is associated with a weight wi. Chiaki would to select some small intervals such that: each integer position x ∈ [1, m] is covered by at least one small interval. let sx be the sum of the weights of all the small intervals covering position x, the maximum value of sx should be minimum. Chiaki would like to know the minimum value ofmaximumsx.

Chiaki has a long interval [1,m] and n small intervals [l1, r1], [l2,r2], ..., [ln, rn]. Each small interval [li,ri] is associated with a weight wi. Chiaki would to select some small intervals such that: each integer position x ∈ [1, m] is covered by at least one small interval. let sx be the sum of the weights of all the small intervals covering position x, the maximum value of sx should be minimum. Chiaki would like to know the minimum value of maximum sx.

HBC17338Interval Revisited题解
-第1张图片-东莞河马信息技术
(图片来源网络,侵删)
成为编程大师,不再是梦想!全网最全C++题库,助您开启编程新篇章。

标签: HBC17338Interval Revisited题解