【动态规划】【数位DP】[2015 Multi-University Training Contest 7]Gray Code
来源:互联网 发布:征兵心理测试软件 编辑:程序博客网 时间:2024/05/14 07:36
题目描述
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.
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)
样例输入
2
00?0
1 2 4 8
????
1 2 4 8
样例输出
Case #1: 12
Case #2: 15
题目分析
就是个裸的DP如果当前为?就看前面是否为?然后我们对于相邻的两位有9种状况分别为??、?1、?0、1?、11、10、2?、21、20然后分别进行DP
代码
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int MAXN = 200000;int v[MAXN+10], f[MAXN+10][2];char str[MAXN+10];int main(){ int T; scanf("%d", &T); for(int t=1;t<=T;t++){ scanf("%s", str+1); int len = strlen(str+1); for(int i=1;i<=len;i++) scanf("%d", &v[i]); str[0] = '0'; f[0][0] = 0; f[0][1] = 0; for(int i=1;i<=len;i++){ if(str[i] == '?'){ if(str[i-1] == '?'){ f[i][0] = max(f[i-1][1]+v[i], f[i-1][0]); f[i][1] = max(f[i-1][0]+v[i], f[i-1][1]); }else if(str[i-1] == '0'){ f[i][0] = f[i-1][0]; f[i][1] = f[i-1][0]+v[i]; }else{ f[i][0] = f[i-1][1]+v[i]; f[i][1] = f[i-1][1]; } }else if(str[i] == '0'){ if(str[i-1] == '?') f[i][0] = max(f[i-1][0], f[i-1][1]+v[i]); else if(str[i-1] == '1') f[i][0] = f[i-1][1] + v[i]; else f[i][0] = f[i-1][0]; } else{ if(str[i-1] == '?') f[i][1] = max(f[i-1][1], f[i-1][0]+v[i]); else if(str[i-1] == '1') f[i][1] = f[i-1][1]; else f[i][1] = f[i-1][0] + v[i]; } } printf("Case #%d: ", t); if(str[len] == '?') printf("%d\n", max(f[len][0], f[len][1])); else printf("%d\n", f[len][str[len]-'0']); } return 0;}
- 【动态规划】【数位DP】[2015 Multi-University Training Contest 7]Gray Code
- 2015 Multi-University Training Contest 7 -- 1007 Gray code
- 2015 Multi-University Training Contest 7 Gray code
- 2010 ACM-ICPC Multi-University Training Contest(5)HDU3485Count 101题解动态规划DP
- 2015 Multi-University Training Contest 7
- 2015 Multi-University Training Contest 7(HDOJ5379)
- 2015 Multi-University Training Contest 7
- 2015 Multi-University Training Contest 7 Clock
- 2015 Multi-University Training Contest 9(区间dp)
- hdu3555 - Bomb(2010 ACM-ICPC Multi-University Training Contest(12))数位dp
- HDU3998 Sequence 动态规划+最大流2011 Multi-University Training Contest 16 - Host by TJU
- 【动态规划】【2014 Multi-University Training Contest 4】The Romantic Hero
- 【动态规划】【2014 Multi-University Training Contest 4】Our happy ending
- 2015 Multi-University Training Contest 1
- 2015 Multi-University Training Contest 1记录
- 2015 Multi-University Training Contest HDU5297
- 2015 Multi-University Training Contest 2
- 2015 Multi-University Training Contest 2
- Android常见问题及开发经验总结
- java 中继承关系中的super的使用
- ASP.Net MVC利用NPOI导入导出Excel - RuleLu
- 【spark】win7-64位下编译spark1.6.0
- iOS中的设计模式
- 【动态规划】【数位DP】[2015 Multi-University Training Contest 7]Gray Code
- SlidingDrawer
- 阅读lmathlib.c
- HDU 2141 Can you find it?
- String
- POJ 3279反转问题,dp
- http 的post与get区别与联系,实践中怎么选择
- Pch文件的主要作用 和分类Category的作用
- JZOJ 1164.求和