Command War(Uva 11729)贪心算法应用

最新推荐文章于 2024-09-22 11:42:19 发布

jdjihaoyu2008

最新推荐文章于 2024-09-22 11:42:19 发布

阅读量585

点赞数

分类专栏： Algorithm算法基础文章标签：算法

本文链接：https://blog.csdn.net/u013225150/article/details/49072909

版权

这是一道关于贪心算法的应用题，涉及指挥士兵执行任务的场景。每个士兵有独特的任务，需要在被简要告知任务后立即执行，且每个士兵的准备时间和执行时间不同。目标是最小化所有任务的完成时间。题目给出多个测试用例，每个用例包含士兵数量和他们的准备与执行时间，要求计算最小总时间。解答中使用贪心策略，按执行时间长的任务优先进行简要，以达到最短总时间。

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

“Waiting for orders we held in the wood, word from the front never came By evening the sound of the gunfire was miles away
Ah softly we moved through the shadows, slip away through the trees Crossing their lines in the mists in the fields on our hands and our knees And all that I ever, was able to see
The fire in the air, glowing red, silhouetting the smoke on the breeze”

Problem Description

There is a war and it doesn’t look very promising for your country. Now it’s time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. You have N soldiers in your squad. In your master-plan, every single soldier has a unique responsibility and you don’t want any of your soldier to know the plan for other soldiers so that everyone can focus on his task only. In order to enforce this, you brief every individual soldier about his tasks separately and just before sending him to th