P3147 [USACO16OPEN]262144

Posted 2020-12-29

???????????????   HERE   value   example   mat   main   mes   NPU   ?????????   

????????????

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???N???262,144) ), each in the range (1???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.

---

????????????

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???N???248) ), each in the range (1???40) . 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!

---

??????????????????????????????????????????????????????(f[i][j])??????(i -j)????????????????????????????????????
??????(k,i,j)???????????????(f[i][j]=max(f[i][j],(f[i][k]==f[k+1][j]) | f[i][k]+1))

#include<iostream>
#include<stdio.h>

using namespace std;

int i,m,n,j,k,maxx,a[1000001],f[300][300];

int main()
{
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&f[i][i]);
    for(i=n-1;i>=1;i--)
        for(j=i;j<=n;j++)
            for(k=j+1;k<=n;k++)
            {
                if(f[i][j]==f[j+1][k]) f[i][k]=max(f[i][k],f[i][j]+1);
                if(f[i][k]>maxx) maxx=f[i][k];
            }
    printf("%d",maxx);
}

---

?????????(n???262144) , (x???40) ????????????????????????(n cdot x)???????????????????????????
(f[i][k][b]) ???(b=1)????????????(i) ???????????????????????????????????????(k)???????????????????????????(f[i][k][b]) ??????????????????????????????(b=0)????????????

??????????????????(x)???????????????(k)??????????????????????????????????????????????????????????????????

#include<iostream>
#include<cstdio>

using namespace std;

int i,m,n,j,k,a[262166][60][2],b[262166],ans;

int main()
{
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&b[i]),a[i][b[i]][1]=a[i][b[i]][0]=i;
    for(i=1;i<=60;i++)
        for(j=1;j<n;j++)
        {
            if(a[j][i][0] && a[j+1][i][1]) 
            {
                a[a[j][i][0]][i+1][1]=a[j+1][i][1];
                a[a[j+1][i][1]][i+1][0]=a[j][i][0];
                ans=i+1;
            }
        }
    printf("%d",ans);
}