HDU 5074 Hatsune Miku(DP)
2016-05-17 21:07
295 查看
思路:状态dp[i][k]表示第i个位置放编号为k的物品,则dp[i][k]=max(dp[i][k],dp[i-1][j]+dis[j][k])然后枚举第i-1为位置上放置的物品就可以了 #include<bits\stdc++.h> using namespace std; int a[150]; int dp[150][150]; int dis[150][150]; int main() { int T; scanf("%d",&T); while(T--) { memset(dp,-1,sizeof(dp)); int n,m; 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 j = 1;j<=m;j++) dp[1][j]=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 = -1e9; for(int i = 1;i<=m;i++) ans = max(ans,dp [i]); printf("%d\n",ans); } }
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 a 1, a 2, . . . , 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? 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, a 1, a 2, . . . , 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. OutputFor 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 -1Sample Output
270 625
相关文章推荐
- CodeForces 608B Hamming Distance Sum
- PAT - 肿瘤诊断 - 三维简单广搜
- 菜单栏垂直导航
- CentOS yum 源的配置与使用
- MIT 6.828 JOS学习笔记18. Lab 3.2 Part B: Page Faults, Breakpoints Exceptions, and System Calls
- Android——计算器
- Connection.setAutoCommit使用的注意事项
- Handler源码分析
- UVa10129 Play on Words 并查集判断连通+欧拉通路
- 字符串算法之KMP算法
- 测试方法---"SFDIPOT"
- saltstack[2]-命令行与state文件
- 【高性能】Linux挂载GPT硬盘
- 在vs2013中如何实现opengl红宝书第八版的首个例子
- 二叉树—小球下落问题
- HDU 5078 Osu!(水题)
- 创建单例的几种方式
- Uva 524 Prime Ring (素数环)
- c# DataTable遍历
- xmlns:android作用以及自定义布局属性