UVa 1467 Installations 解题报告（贪心）

最新推荐文章于 2022-05-04 22:46:10 发布

SF-_-

最新推荐文章于 2022-05-04 22:46:10 发布

阅读量1k

点赞数

分类专栏：思维 ACM

本文链接：https://blog.csdn.net/sf____/article/details/38057593

版权

该博客介绍了如何解决一个电信公司服务工程师的工作调度问题，目标是通过贪心策略找到最小化延迟罚款总和的解决方案。博客内容涉及输入输出格式、示例及解题过程，提出了一种根据截止日期排序并寻找最大和次大罚款的方法来优化调度。

摘要由CSDN通过智能技术生成

1467 - Installations

Time limit: 3.000 seconds

In the morning, service engineers in a telecom company receive a list of jobs which they must serve today. They install telephones, internet, ipTVs, etc and repair troubles with established facilities. A client requires a deadline when the requested job must be completed. But the engineers may not complete some jobs within their deadlines because of job overload. For each job, we consider, as a penalty of the engineer, the difference between the deadline and the completion time. It measures how long the job proceedsafter its deadline. The problem is to find a schedule minimizing the sum of the penalties of the jobs with the two largest penalties.

A service engineer gets a list of jobs J_i with a serving times_i and a deadlined_i. A job J_i needs times_i, and if it is completed at timeC_i, then the penalty of J_i is defined to bemax{0, C_i -d_i}. For convenience, we assume that the timet when a job can be served is0 $\le$ t < $\infty$ and