HDU 5074 Hatsune Miku (2014 Anshan onsite competition)

Hatsune Miku Time Limit: 2000/1000 MS (Java/others) memory limit: 262144/262144 K (Java/Others)
Total submission (s): 17 accepted submission (s): 14


Problem descriptionhatsune 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 A1, A2 ,..., an, is simply the sum of score (AI, AI + 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?
Inputthe 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, A1, A2 ,..., an (-1 ≤ AI ≤ m, AI =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.
Outputfor each test case, output the answer in one line.
Sample Input

25 383 86 7715 93 3586 92 493 3 3 1 210 536 11 68 67 2982 30 62 23 6735 29 2 22 5869 67 93 56 1142 29 73 21 19-1 -1 5 -1 4 -1 -1 -1 4 -1

 
Sample output

270625

 

-1 can be converted to 1 ~ M value, calculate the maximum value, simple DP

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=150;int map[maxn][maxn];int dp[maxn][maxn];int a[1000];int main(){    int n,t,m;    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",&map[i][j]);            }        }        for(int i=1; i<=n; i++)            scanf("%d",&a[i]);        for(int i=0; i<maxn; i++)        {            for(int j=0; j<maxn; j++)            {                dp[i][j]=-99999999;            }        }        int ans=0;        if(a[1]>0)            dp[1][a[1]]=0;        else        {            for(int i=1; i<=m; i++)            {                dp[1][i]=0;                // printf("%d ",dp[1][i]);            }        }        for(int i=2; i<=n; i++)        {            if(a[i]>0)            {                for(int j=1; j<=m; j++)                {                    dp[i][a[i]]=max(dp[i][a[i]],dp[i-1][j]+map[j][a[i]]);                }            }            else            {                for(int j=1; j<=m; j++)                {                    for(int k=1; k<=m; k++)                    {                        dp[i][j]=max(dp[i][j],dp[i-1][k]+map[k][j]);                    }                }            }            //printf("%d\n",dp[i][a[i]]);        }        for(int i=1; i<=m; i++)            ans=max(ans,dp[n][i]);        printf("%d\n",ans);    }    return 0;}

HDU 5074 Hatsune Miku (2014 Anshan onsite competition)