# hdu5375 dp

138人阅读 评论(0)

C - Gray code
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Appoint description:

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

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
using namespace std;
const int maxn=1e6,inf=0x3f3f3f3f;
int a[maxn];
char str[maxn];
int dp[maxn][2];
///dp[i][0] 表示第i项是0 的最大和 dp[i][1]表示第i项是1 的最大和
int main()
{
int T=1,t;
int n;
scanf("%d",&t);
while(t--)
{
scanf("%s",str);
n=strlen(str);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
dp[0][1]=dp[0][0]=-inf;
if(str[0]=='1'||str[0]=='?')
dp[0][1]=a[0];
if(str[0]=='0'||str[0]=='?')
dp[0][0]=0;

for(int i=1;i<n;i++)
{
dp[i][0]=dp[i][1]=-inf;
if(str[i]=='1'||str[i]=='?')///当前为为1或？
dp[i][1]=max(dp[i-1][0]+a[i],dp[i-1][1]);
///上一位是0 + 当前a[i] 值，上一位是1 异或为0 不加a[i]
if(str[i]=='0'||str[i]=='?')
dp[i][0]=max(dp[i-1][1]+a[i],dp[i-1][0]);
}
printf("Case #%d: %d\n",T++,max(dp[n-1][0],dp[n-1][1]));
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：52117次
• 积分：3232
• 等级：
• 排名：第10696名
• 原创：273篇
• 转载：17篇
• 译文：0篇
• 评论：8条
博客专栏
 AC 文章：6篇 阅读：3653
最新评论