POJ - 1862：Stripies

wingrez

于 2019-09-01 01:22:39 发布

阅读量288

点赞数

CC 4.0 BY-SA版权

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

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

本文链接：https://blog.csdn.net/wingrez/article/details/100179260

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

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

该博客讨论了如何解决POJ - 1862：Stripies问题，涉及贪心算法和优先队列。当两个stripies碰撞时，新生成的stripie重量为两者的平方根乘积。目标是找到使stripies群体总重量最小化的策略。博主提供了解题思路和参考代码。

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

Stripies

来源：POJ

标签：贪心算法，优先队列

参考资料：

相似题目：

题目

Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an international patent). The stripies are transparent amorphous amebiform creatures that live in flat colonies in a jelly-like nutrient medium. Most of the time the stripies are moving. When two of them collide a new stripie appears instead of them. Long observations made by our scientists enabled them to establish that the weight of the new stripie isn’t equal to the sum of weights of two disappeared str