洛谷 P3147 [USACO16OPEN]262144

洛谷 P3147 [USACO16OPEN]262144

题目描述

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$N$ positive integers ($2\le N\le 262,144$), each in the range $1\dots 40$. In one move, Bessiecan take two adjacent numbers with equal values and replace them asingle number of value one greater (e.g., she might replace twoadjacent 7s with an 8). The goal is to maximize the value of thelargest number present in the sequence at the end of the game. Pleasehelp Bessie score as highly as possible!

Bessie喜欢在手机上下游戏玩（……），然而她蹄子太大，很难在小小的手机屏幕上面操作。

她被她最近玩的一款游戏迷住了，游戏一开始有n个正整数，(2<=n<=262144)，范围在1-40。在一步中，贝西可以选相邻的两个相同的数，然后合并成一个比原来的大一的数（例如两个7合并成一个8)，目标是使得最大的数最大，请帮助Bessie来求最大值。

输入输出格式

输入格式：

The first line of input contains $N$, and the next $N$ lines give the sequence

of $N$ 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.

分析：数据范围很奇特：n巨大，a[i]巨小——如果O(N^3)能接受就直接区间DP水过了，但是不行，于是考虑设计一个状态囊括a[i]。注意到a[i]每次合并只+1，于是想到答案其实就是最大的被合并的数+1，并且可以按a[i]从小到大的顺序DP。

状态：f[i][j]表示从第j个数向右合并成数字i的下标的下一位。

状态转移方程：f[i][j]=f[i-1][j]?f[i-1][f[i-1][j]]:f[i][j]。（这里也可以取max，因为可以证明答案是唯一的。）

总结：看数据猜算法，这种特殊范围基本有特殊含义。

           这道题的dp状态有点类似倍增：即当前状态可以由两个前一次状态合并得到。