【动态规划】【数位DP】[2015 Multi-University Training Contest 7]Gray Code
2016-02-17 19:17
543 查看
题目描述
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)
样例输入
200?0
1 2 4 8
????
1 2 4 8
样例输出
Case #1: 12Case #2: 15
题目分析
就是个裸的DP如果当前为?就看前面是否为?然后我们对于相邻的两位有9种状况分别为??、?1、?0、1?、11、10、2?、21、20然后分别进行DP代码
[code]#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; }
相关文章推荐
- Grails自动化测试
- xcode升级运行报错 Command /usr/bin/codesign failed with exit code 1(api打包出错)
- 关于 Paint和TextPaint的个人理解
- Greedy:Paint Color(AOJ 0531)
- 通信之进程间通信-AIDL
- AIDL介绍和实例讲解
- 深入理解TAILQ队列(转自http://blog.csdn.net/hunanchenxingyu/article/details/8648794)
- (110) Connection timed out的错HttpClient 每次请求未close导致 Nginx connect failed (110- Connection timed out)
- 在MainActivity的内部静态类PlaceholderFragment 类中的onCreateView中获取fragment_main.xml中控件
- 关于AI的目标导向型行动计划
- 游戏人工智能开发之6种决策方法
- STL 之随机访问迭代器 http://blog.csdn.net/tangaowen/article/details/7515558
- 使用stl中的 advance和 distance 方法来进行iterator的加减 http://blog.csdn.net/tangaowen/article/details/7515558
- 置顶] 简单的程序诠释C++ STL算法系列之十三:copy http://blog.csdn.net/jerryjbiao/article/details/7376088
- Better Business Grammar Train Summary
- gitlab push时报错error:failed to push some refs to 'git@xxx.xx.xx.xxx:xxxx/xxx.git'
- 【Lintcode】Restore IP Addresses, Number of Airplanes in the Sky
- 无法解决 equal to 运算中 "Chinese_PRC_CI_AS" 和 "Chinese_PRC_90_CI_AI" 之间的排序规则冲突。的解决方法
- LeetCode 217. Contains Duplicate
- Failed to locate or generate matchin signing assets