HDU 5375 Gray code(DP或分情况讨论)
来源:互联网 发布:屠龙战记翅膀进阶数据 编辑:程序博客网 时间:2024/06/05 18:53
Gray code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 50 Accepted Submission(s): 27
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.
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)
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
200?01 2 4 8????1 2 4 8
Sample Output
Case #1: 12Case #2: 15Hinthttps://en.wikipedia.org/wiki/Gray_codehttp://baike.baidu.com/view/358724.htm
Source
2015 Multi-University Training Contest 7
#include<stdio.h>#include<string.h>const int N = 200005;int a[N];char str[N];int main(){ int n,T,c=0; scanf("%d",&T); while(T--){ scanf("%s",str+1); str[0] = '0' ; n=strlen(str); for(int i=1; i<n; i++) scanf("%d",&a[i]); int ans =0 ; str[n] = '0'; for(int i=1; i<n; i++) if(str[i]!='?'){ int f = (str[i]-'0')^(str[i-1]-'0') ; if( f ) ans += a[i]; } else{ int j = i , sum = 0 , mina = 1<<30; while(str[j]=='?'&&j<n){ sum += a[j]; if( mina > a[j] ) mina = a[j]; j++; } if(j<n){ sum += a[j]; if( mina > a[j] )mina = a[j]; } if(str[i-1]=='0'&&str[j]=='0' || str[i-1]=='1'&&str[j]=='1'){ if((j-i)%2==0&&j<n) //(j-i)表示?的个数 sum -= mina; } else if(str[i-1]=='0'&&str[j]=='1' || str[i-1]=='1'&&str[j]=='0'){ if( (j-i)%2 == 1 ) sum -= mina; } ans += sum; i=j; } printf("Case #%d: %d\n",++c,ans); }}
0 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-格雷码dp)
- [HDU 5375 Gray code] 15多校赛DP
- HDU 5375 Gray code
- Java中使用MongoDB进行增删改查
- 《Java开发实战经典》第三章答案3.12
- 关于中断的buttom half (二)
- hdoj 1301 Jungle Roads 【最小生成树】
- 自定义点击方法target-action
- HDU 5375 Gray code(DP或分情况讨论)
- YTU 2896/POJ 2192 Zipper dfs
- matlab 更改可用内存(最快速有效方法)
- Sort List
- 小P的故事——神奇的饭卡
- 一些文章
- JavaWab基础
- poj 1729 Jack and Jill 1376 Robot 1324 Holedox Moving 1475 Pushing Boxes bfs + a*
- hdu3328(Flipper)经典栈类