P3147 [USACO16OPEN]262144 P

Rhyems

于 2022-05-26 14:10:00 发布

阅读量247

点赞数

分类专栏：刷题文章标签： c++ 算法

本文链接：https://blog.csdn.net/y13438985462/article/details/124982687

版权

刷题专栏收录该内容

13 篇文章 0 订阅

订阅专栏

题目链接
题目描述：# [USACO16OPEN]262144 P

题目描述

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 ( $\leq N\leq 262,144$ ), each in the range $\ldots 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

样例输入 #1

样例输出 #1

提示

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，一看范围直接G了。这题维护的信息很有意思
$f [i] [j]$ 表示合成的数字为 $i$ ，并且这个区间的左端点为 $j$ 时的右端点。

需要连续两段的值都为 $i - 1$ 时才能合成 $i$ 。
如下图，那么此时的状态转移方程为：
$f [i] [j] = f [i - 1] [f [i - 1] [j]]$
$f [i - 1] [j]$ 表示左端点为 $a$ , 值为 $i - 1$ 时的右端点，即为下图中点 $b$
那么以 $b$ 为左端点，值为 $i - 1$ 的点就可以表示为 $f [i - 1] [f [i - 1] [j]]$ ，即右端点，等于 $f [i] [j]$
在这里插入图片描述
初始化：
初始化时不能让 $f [i] [j] = j$ ，不然更新 $f [i] [j] = f [i - 1] [f [i - 1] [j]]$ 时，会一直让 $f [i] [j] = j$ ，比如：
对于样例的： $1$ $1$ $1$ $2$ 我们将 $f [1] [2] = 2$
$f [2] [2] = f [1] [f [1] [2]] = f [1] [2] = 2$ ，右端点完全没有被改变，所以我们初始化时将所有区间右端点全部 + $1$ ，最后更新出来的答案也只是多 $1$ 的，即上面应该更新为： $f [1] [2] = 3$ $f [1] [3] = 4$
$f [2] [2] = f [1] [f [1] [2]] = f [1] [3] = 4$ 也只是比原来多 $1$ ，可以发现最终答案不会被影响
代码：

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> PII;
const int N = 3e5 + 10;
int f[60][N];

int main() {
   ios::sync_with_stdio(false); 
   cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
   freopen("D:/Cpp/program/Test.in", "r", stdin);
   freopen("D:/Cpp/program/Test.out", "w", stdout);
#endif
    int n; cin >> n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i ++) {
        int x; cin >> x;
        f[x][i] = i + 1;
    }
    int ans = 0;
    for(int i = 2; i <= 58; i ++) {
        for(int j = 1; j <= n; j ++) {
            if(!f[i][j])
                f[i][j] = f[i - 1][f[i - 1][j]];
            if(f[i][j]) ans = i;
        }
    }
    cout << ans << '\n';
}