UVa 10954 Add All (石子合并_优先队列)

最新推荐文章于 2023-01-20 12:57:05 发布

h1021456873

最新推荐文章于 2023-01-20 12:57:05 发布

阅读量591

点赞数

分类专栏： STL UVa 白书

本文链接：https://blog.csdn.net/h1021456873/article/details/48212227

版权

本文详细解析了UVa在线判题系统中的一道题目10954 - Add All，主要探讨如何利用优先队列（堆）来优化石子合并的过程，降低时间复杂度，提高算法效率。通过对问题的深入理解和巧妙的数据结构运用，实现了高效的解决方案。

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

10954 Add All
Yup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves
condescended, to write a C/C++ program just to add a set of numbers. Such a problem will simply
question your erudition. So, lets add some flavor of ingenuity to it.
Addition operation requires cost now, and the cost is the summation of those two to be added. So,
to add 1 and 10, you need a cost of 11. If you want to add 1, 2 and 3. There are several ways
1 + 2 = 3, cost = 3 1 + 3 = 4, cost = 4 2 + 3 = 5, cost = 5
3 + 3 = 6, cost = 6 2 + 4 = 6, cost = 6 1 + 5 = 6, cost = 6
Total = 9 Total = 10 Total = 11
I hope you have understood already your mission, to add a set of integers so that the cost is minimal.
Input
Each test case will start with a positive number, N (2 ≤ N ≤ 5000) followed by N