HDU 5074-Hatsune Miku(DP)
2015-12-24 12:04
225 查看
Hatsune Miku
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 29 Accepted Submission(s): 25
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 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?
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, 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.
Output
For each test case, output the answer in one line.
Sample Input
2 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鞍山现场赛的第二道水题。。 。设状态dp[i][k]表示第i个位置放编号为k的物品,则dp[i][k]=max(dp[i][k],dp[i-1][j]+dis[j][k])枚举第i-1为位置上放置的物品。#include <cstdio> #include <iostream> #include <algorithm> #include <cstring> #include <cctype> #include <cmath> #include <cstdlib> #include <vector> #include <queue> #include <set> #include <map> #include <list> #define ll long long using namespace std; const int INF=0x3f3f3f3f; int n,m,dis[55][55],a[110],dp[110][55]; int main() { int T; scanf("%d",&T); while(T--) { memset(dp,-1,sizeof(dp)); scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) for(int j=1;j<=m;j++) scanf("%d",&dis[i][j]); for(int i=1;i<=n;i++) scanf("%d",&a[i]); if(a[1]!=-1) dp[1][a[1]]=0; else for(int i=1;i<=m;i++) dp[1][i]=0; for(int i=2;i<=n;i++) { for(int j=1;j<=m;j++) { if(dp[i-1][j]!=-1) { if(a[i]!=-1) dp[i][a[i]]=max(dp[i][a[i]],dp[i-1][j]+dis[j][a[i]]); else for(int k=1;k<=m;k++) dp[i][k]=max(dp[i][k],dp[i-1][j]+dis[j][k]); } } } int ans=-INF; for(int i=1;i<=m;i++) ans=max(ans,dp [i]); printf("%d\n",ans); } return 0; }
相关文章推荐
- 用jQuery与JSONP轻松解决跨域访问的问题
- Raid5磁盘阵列修复方法介绍
- PHP版本如何选择?应该使用哪个版本?
- 条件选择结构<1>__笔记(3)
- JDBC连接池的testQuery/validationQuery设置
- Hibernate count和sum查询
- 第三部分 OpenStack镜像管理
- Image Lazy Load:那些延时加载图片的开源插件(jQuery)
- php让你头疼的浮点数运算
- String转化为byte[]和byte[]转化为String
- Spring的事务传播属性
- 关闭eclipse自动弹出console功能
- [手势与触摸]创建可以拖动的视图
- android studio快捷键
- Path Follow System using Waypoints C#
- PHP编译参数详解
- Android 异步加载图片,使用LruCache和SD卡或手机缓存,效果非常的流畅
- 详解Python字符串对象的实现
- 翻译 | 2015年的最佳Material Design集锦 【上篇】
- 第二部分 OpenStack安装与配置