BZOJ4580: [Usaco2016 Open]248 dp

最新推荐文章于 2018-10-22 11:29:34 发布

BeyondW__

最新推荐文章于 2018-10-22 11:29:34 发布

阅读量1k

点赞数

分类专栏：算法 dp 文章标签： dp 算法

本文链接：https://blog.csdn.net/BeyondW__/article/details/52250876

版权

算法同时被 2 个专栏收录

33 篇文章 0 订阅

订阅专栏

12 篇文章 0 订阅

订阅专栏

Description
Bessie likes downloading games to play on her cell phone, even though she does find the small touch
screen rather cumbersome to use with her large hooves.She is particularly intrigued by the current g
ame she is playing. The game starts with a sequence of NN positive integers (2≤N≤248), each in the
range 1…40. In one move, Bessie can take two adjacent numbers with equal values and replace them a
single number of value one greater (e.g., she might replace two adjacent 7s with an 8). The goal is
to maximize the value of the largest number present in the sequence at the end of the game. Please
help Bessie score as highly as possible!

Input
The first line of input contains N, and the next N lines give the sequence of N numbers at the start
of the game.

Output

Please output the largest integer Bessie can generate.

Sample Input
4

2
Sample Output
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，表示一个值往后找最多能找到的地方，再转移一下就行**

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1<<18|1;
int dp[MAXN][57],a[MAXN];
int main(int argc, char *argv[])
{
    int n,i,j,ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++) {
        scanf("%d",&a[i]);
        dp[i][a[i]]=i;
        j=i-1;
        while(dp[j][a[i]]) {
            j=dp[j][a[i]]-1; 
            a[i]++; 
            dp[i][a[i]]=j+1; 
        }
        if(ans<a[i]) ans=a[i];
    }
    printf("%d\n",ans);
    return 0;
}