hdu 5375 Gray code(DP)
来源:互联网 发布:网络电视要不要机顶盒 编辑:程序博客网 时间:2024/05/23 11:31
hdu 5375 Gray code
Problem Description
The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only onebit (binary digit). The reflected binary code was originally designed to prevent spurious output from electromechanical switches. Today, Gray codes are widely used to facilitate error correction in digital communications such as digital terrestrial television and some cable TV systems.
Now , you are given a binary number of length n including ‘0’ , ’1’ and ‘?’(? means that you can use either 0 or 1 to fill this position) and n integers(a1,a2,….,an) . A certain binary number corresponds to a gray code only. If the ith bit of this gray code is 1,you can get the point ai.
Can you tell me how many points you can get at most?
For instance, the binary number “00?0” may be “0000” or “0010”,and the corresponding gray code are “0000” or “0011”.You can choose “0000” getting nothing or “0011” getting the point a3 and a4.
Input
The first line of the input contains the number of test cases T.
Each test case begins with string with ‘0’,’1’ and ‘?’.
The next line contains n (1<=n<=200000) integers (n is the length of the string).
a1 a2 a3 … an (1<=ai<=1000)
Output
For each test case, output “Case #x: ans”, in which x is the case number counted from one,’ans’ is the points you can get at most
Sample Input
2
00?0
1 2 4 8
????
1 2 4 8
Sample Output
Case #1: 12
Case #2: 15
Hint
https://en.wikipedia.org/wiki/Gray_code
http://baike.baidu.com/view/358724.htm
题目大意:给出一个包含‘1’,‘0’,‘?’的二进制数,‘?’可以是‘0’或‘1’。将该二进制数转化为格雷码。并将num数组中该位格雷码为‘1’的数相加,求该和的最大值。
解题思路:DP。
#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>using namespace std;const int N = 200005;const int INF = 0x3f3f3f3f;typedef long long ll;char s[N];int dp[N][2], num[N];int main() { int T, Case = 1; scanf("%d", &T); while (T--) { getchar(); printf("Case #%d: ", Case++); gets(s); int len = strlen(s); for (int i = 0; i < len; i++) { scanf("%d", &num[i]); } if (s[0] == '1') { dp[0][1] = num[0]; dp[0][0] = -INF; } else if (s[0] == '0') { dp[0][1] = -INF; dp[0][0] = 0; } else { dp[0][1] = num[0]; dp[0][0] = 0; } for (int i = 1; i < len; i++) { if (s[i] == '0') { dp[i][0] = max(dp[i - 1][1] + num[i], dp[i - 1][0]); dp[i][1] = -INF; } else if (s[i] == '1') { dp[i][1] = max(dp[i - 1][0] + num[i], dp[i - 1][1]); dp[i][0] = -INF; } else { dp[i][1] = max(dp[i - 1][0] + num[i], dp[i - 1][1]); dp[i][0] = max(dp[i - 1][1] + num[i], dp[i - 1][0]); } } printf("%d\n", max(dp[len - 1][1], dp[len - 1][0])); } return 0;}
- HDU 5375 Gray code(DP)
- hdu 5375 Gray code(DP)
- HDU 5375 Gray code(DP)
- hdu 5375 Gray code(dp)
- hdu 5375 Gray code(dp)
- HDU 5375 Gray code (简单dp)
- hdu 5375 Gray code dp
- hdu 5375 Gray code (dp)
- hdu 5375 Gray code dp
- hdu 5375 Gray code (DP)
- hdu 5375 Gray code (DP)
- hdu 5375 Gray code (简单DP)
- HDU 5375 Gray code //递推dp
- hdu 5375 - Gray code(dp) 解题报告
- HDU 5375(Gray code-格雷码dp)
- [HDU 5375 Gray code] 15多校赛DP
- HDU 5375 Gray code
- HDU 5375 Gray code
- 用RAID0 安装Ubuntu Server
- java复习-类和对象(二)
- java实现邮箱发送功能
- POJ2429 GCD & LCM Inverse
- hdu 4185 Oil Skimming
- hdu 5375 Gray code(DP)
- Struts2多文件的上传
- 2015.08.10总结
- Tempus et mobilius Time and motion栈与队列
- APK防反编译技术
- Web支持可暂停的超大文件上传
- 内核通知链原理及机制
- 04 迷宫寻路
- 高效程序员的狂暴之路