HBC24880兔子的排列,动态规划,过关题目[USACO 2009 Ope G]Work Scheduling题解

题库丰富多样，涵盖各个领域，全网最全C++题库，让您在练习中不断成长！

Farmer John has so very many jobs to do!In order to run the farm efficiently, he must make money on the jobs he does, each one of which takes just one time unit.His work day starts at time 0 and has 1,000,000,000 time units (!). He currently can choose from any of N (1

Farmer John has so very many jobs to do! In order to run the farm efficiently, he must make money on the jobs he does, each one of which takes just one time unit. His work day starts at time 0 and has 1,000,000,000 time units (!). He currently can choose from any of N (1 <= N <= 100,000) jobs conveniently numbered 1..N for work to do. It is possible but extremely unlikely that he has time for all N jobs since he can only work on one job during any time unit and the deadlines tend to fall so that he can not perform all the tasks. Job i has deadline Di (1 <= Di <= 1,000,000,000). If he finishes job i by then, he makes a profit of Pi (1 <= Pi <= 1,000,000,000). What is the maximum total profit that FJ can earn from a given list of jobs and deadlines? The answer might not fit into a 32-bit integer.

不断挑战自我，才能突破极限！全网最全C++题库，让您在编程道路上越走越远。

标签： HBC24880兔子的排列 动态规划 过关题目[USACO 2009 Ope G]Work Scheduling题解