poj1738 An old Stone Game 石子合并(归并) GarsiaWachs算法

最新推荐文章于 2018-09-13 19:37:00 发布

RunMyBrain

最新推荐文章于 2018-09-13 19:37:00 发布

阅读量2.3k

点赞数 1

分类专栏： WIKIOI DP POJ

本文链接：https://blog.csdn.net/u011328276/article/details/9669531

版权

本文介绍了POJ1738题目——石子合并问题，通过分析得出利用GarsiaWachs算法可以解决大范围下无法使用DP数组的问题。算法核心在于找到满足特定条件的石子堆进行合并，确保合并顺序正确，从而得到最小得分。

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

Description

There is an old stone game.At the beginning of the game the player picks n(1<=n<=50000) piles of stones in a line. The goal is to merge the stones in one pile observing the following rules:
At each step of the game,the player can merge two adjoining piles to a new pile.The score is the number of stones in the new pile.
You are to write a program to determine the minimum of the total score.

Input

The input contains several test cases. The first line of each test case contains an integer n, denoting the number of piles. The following n integers describe the number of stones in each pile at the beginning of the game.
The last test case is followed by one zero.

Output

For each test case output the ans