题意：给你一串不确定的二进制码，其对应的格雷码的每一位有对应的权值，问转换成的格雷码的能取到的最大权值是多少。
思路：没有思路，乱搞也AC
#pragma comment(linker, "/STACK:1000000000")
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#define LL long long
#define MAXN 100005
#define INF 0x3f3f3f3f
#define eps 1e-8
using namespace std;
char s[];
LL a[];
LL f[][];
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // OPEN_FILE
int T;
scanf("%d", &T);
int cas = ;
while(T--){
scanf("%s", s + ); int m = strlen(s + );
for(int i = ; i <= m; i++){
scanf("%I64d", &a[i]);
}
LL ans = ;
int last;
memset(f, -, sizeof(f));
if(s[] != ''){
f[][] = a[];
}
if(s[] != ''){
f[][] = ;
}
for(int i = ; i <= m; i++){
if(s[i] == '' || s[i] == '?'){
if(f[i - ][] >= ){
f[i][] = max(f[i][], f[i - ][] + a[i]);
}
if(f[i - ][] >= ){
f[i][] = max(f[i][], f[i - ][]);
}
}
if(s[i] == '' || s[i] == '?'){
if(f[i - ][] >= ){
f[i][] = max(f[i][], f[i - ][] + a[i]);
}
if(f[i - ][] >= ){
f[i][] = max(f[i][], f[i - ][]);
}
}
}
printf("Case #%d: %I64d\n", cas++, max(f[m][], f[m][]));
}
}