跪求一具有挑战性问题的解答！！！

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

There are m available work queues and n jobs (m >= n > 0). The jobs are independent of each other. A job can be executed on any work queue at any time, but once started, it will fully occupy the work queue until finish. For job denoted as i (1 <= i <= n), it will take t_i time to run on a work queue, and it has to be executed before the deadline d_i, or it is deemed abandoned. Please design an efficient algorithm that tries to maximize the number of jobs that can be arranged to execute before their respective deadlines. If possible, please also describe a scenario that the algorithm you propose might fail, a concrete example is preferred.

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：挑战性 性问题 Independent Dependent Available 解答 挑战性

题目换成英语好些，那样我这个没过四级的可以直接略过了。哎，杯具了。