hdu 5074 Hatsune Miku【DP】

最新推荐文章于 2024-06-27 20:37:57 发布

mengxiang000000

最新推荐文章于 2024-06-27 20:37:57 发布

阅读量2k

点赞数

CC 4.0 BY-SA版权

分类专栏： dp 文章标签： hdu 5074 杭电 5074

本文链接：https://blog.csdn.net/mengxiang000000/article/details/52723935

dp 专栏收录该内容

351 篇文章

订阅专栏

本文介绍了一个编程问题，通过动态规划算法来寻找给定音符序列的最高美感得分。需要考虑固定音符位置和其他可变位置，以最大化最终乐曲的整体美感。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hatsune Miku

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1495 Accepted Submission(s): 1015

Problem Description

Hatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on your own using the vocal package.

Today you want to compose a song, which is just a sequence of notes. There are only m different notes provided in the package. And you want to make a song with n notes.

Also, you know that there is a system to evaluate the beautifulness of a song. For each two consecutive notes a and b, if b comes after a, then the beautifulness for these two notes is evaluated as score(a, b).

So the total beautifulness for a song consisting of notes a₁, a₂, . . . , a_n, is simply the sum of score(a_i, a_i+1) for 1 ≤ i ≤ n - 1.

Now, you find that at some positions, the notes have to be some specific ones, but at other positions you can decide what notes to use. You want to maximize your song’s beautifulness. What is the maximum beautifulness you can achieve?

Input

The first line contains an integer T (T ≤ 10), denoting the number of the test cases.

For each test case, the first line contains two integers n(1 ≤ n ≤ 100) and m(1 ≤ m ≤ 50) as mentioned above. Then m lines follow, each of them consisting of m space-separated integers, the j-th integer in the i-th line for score(i, j)( 0 ≤ score(i, j) ≤ 100). The next line contains n integers, a₁, a₂, . . . , a_n (-1 ≤ a_i ≤ m, a_i ≠ 0), where positive integers stand for the notes you cannot change, while negative integers are what you can replace with arbitrary notes. The notes are named from 1 to m.

Output

For each test case, output the answer in one line.

Sample Input

5 3

83 86 77

15 93 35

86 92 49

3 3 3 1 2

10 5

36 11 68 67 29

82 30 62 23 67

35 29 2 22 58

69 67 93 56 11

42 29 73 21 19

-1 -1 5 -1 4 -1 -1 -1 4 -1

Sample Output

270

625

Source

2014 Asia AnShan Regional Contest

题目大意：

给你一个M*M的分值表矩阵，让你计算给出的N个数的最大计算和，计算规则如下：

给你N个数：a1,a2,a3,a4.........an,sum=(a1,a2)+(a2,a3)+(a3,a4)..........+a(an-1,an);【其中对应（a1,a2）的值为矩阵中位子a1，a2的数】

对应给出的ai如果是-1，那么其可以转换成从1到m的任意数。

思路：

1、首先这个问题贪心是显然不行的，枚举也是一定TLE的，那么想dp方向。

2、设定dp【i】【j】，表示当前计算到第i个数，并且当前第i个数为j的最大和的值。

辣么不难想到状态转移方程：

dp【i】【jj】=max（dp【i】【jj】，dp【i-1】【k】+w（k，j））；

那么时间复杂度：一层for枚举i，一层for 枚举j，一层for枚举k，时间复杂度：O（n^2m），其中if(a【i】!=-1)jj=a【i】;else jj=j，if(a【i-1】!=-1)kk=a【i-1】;else kk=k；

3、那么如果a【n】==-1，枚举维护dp【n】【i】的最大值，输出，如果a【n】！=-1，那么输出dp【n】【a【n】】即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int n,m;
int a[500][500];
int dp[500][500];
int b[560];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=2;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                int jj,kk;
                if(b[i]!=-1)jj=b[i];
                else jj=j;
                for(int k=1;k<=m;k++)
                {
                    if(b[i-1]!=-1)kk=b[i-1];
                    else kk=k;
                    dp[i][jj]=max(dp[i][jj],dp[i-1][kk]+a[kk][jj]);
                }
            }
        }
        if(b[n]!=-1)
        printf("%d\n",dp[n][b[n]]);
        else
        {
            int output=0;
            for(int i=2;i<=m;i++)
            {
                if(output<dp[n][i])output=dp[n][i];
            }
            printf("%d\n",output);
        }
    }
}