【USACO16OPEN】248 动态规划

最新推荐文章于 2022-10-19 14:52:10 发布

zhhe0101

最新推荐文章于 2022-10-19 14:52:10 发布

阅读量840

点赞数

分类专栏： dp 题库

本文链接：https://blog.csdn.net/zhhe0101/article/details/53192339

版权

Bessie在手机游戏中尝试通过合并相同数字来最大化序列中的最大值。利用动态规划策略，找到将给定1到n的地图中数字合并后能得到的最大数。输入输出格式和样例展示了解题过程，最终实现时间为O(n)。

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

题目描述

Bessie likes downloading games to play on her cell phone, even though she doesfind the small touch screen rather cumbersome to use with her large hooves.

She is particularly intrigued by the current game she is playing.The game starts with a sequence of positive integers (), each in the range . In one move, Bessie cantake two adjacent numbers with equal values and replace them a singlenumber of value one greater (e.g., she might replace two adjacent 7swith an 8). The goal is to maximize the value of the largest numberpresent in the sequence at the end of the game. Please help Bessiescore as highly as possible!

给定一个1*n的地图，在里面玩2048，每次可以合并相邻两个，问最大能合出多少

输入输出格式

输入格式：
The first line of input contains , and the next lines give the sequence

of numbers at the start of the game.

输出格式：
Please output the largest integer Bessie can generate.

输入输出样例

输入样例#1：
4
1
1
1
2
输出样例#1：
3
说明

In this example shown here, Bessie first merges the second and third 1s to

obtain the sequence 1 2 2, and then she merges the 2s into a 3. Note that it is

not optimal to join the first two 1s.

正解：动态规划，类似于石子合并。遇到dp还是要多思考，多想想以前做过的题。
f[i][