UVA - 11729：Commando War

最新推荐文章于 2022-02-10 17:36:59 发布

wingrez

最新推荐文章于 2022-02-10 17:36:59 发布

阅读量315

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/82357197

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

这篇博客介绍了UVA的一道竞赛题目——Commando War。问题涉及到如何安排士兵的指令顺序以最小化总耗时，不依赖于其他士兵的任务。输入包含士兵数量和他们的准备与执行时间，解题策略是优先安排执行时间长的任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Commando War

来源：UVA

标签：排序，贪心算法

参考资料：

相似题目：

题目

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 the battlefield. You know that every single soldier needs a certa

了解本专栏