hdu 5375 - Gray code(dp) 解题报告
2015-08-14 16:20
330 查看
Gray code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 684 Accepted Submission(s): 402
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.
![](http://acm.hdu.edu.cn/data/images/5375-1.jpg)
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。将其转换成格雷码,每一位都有对应的数值,问将所有格雷码为1的数值相加,求最大值。
题解:首先我们要知道二进制码怎么转换为格雷码。将所需转换的数右移一位再与原数异或即可。这里我们可以发现当前位置的取值至于下一位有关,所以我们想可以用dp解决此问题。
参考代码:
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define ll long long #define max(a,b) a>b?a:b using namespace std; const int N = 200005; const int INF = 999999999; char s ; int dp [2], num ; int main() { int T, Case = 1; scanf("%d", &T); while (T--) { getchar(); 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("Case #%d: ", Case++); printf("%d\n", max(dp[len - 1][1], dp[len - 1][0])); } return 0; }
相关文章推荐
- FHS 标准的文件系统的目录结构
- c#异步调用和回调
- css三角的做法
- 【锋利的jQuery】学习笔记02
- 二分查找(JAVA)
- 判断IP地址,MAC地址合法性-C语言
- Triangle LOVE 4324 (拓扑排序)
- 二三十万汽车选型指南
- Ivshmem实现分析与性能测试
- 关于在header里增加参数的方式
- 微信支付过程中遇到的问题
- Android Fragment 你应该知道的一切
- 设计模式:观察者模式
- BZOJ 1212 HNOI2004 L语言 AC自己主动机(Trie树)+动态规划
- 【ASP.NET开发】获取客户端IP地址 via C#
- 必须记住的30类选择器
- c# EmguCv定位二维码
- maven在eclipse建立工程,运行出现Server IPC version 9 cannot communicate with client version 4错误
- 迅雷批量下载
- Android基于mAppWidget实现手绘地图(十四)–在一个应用中使用多个地图