zoukankan      html  css  js  c++  java
  • 2015 Multi-University Training Contest 7 hdu 5375 Gray code

    Gray code

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 129    Accepted Submission(s): 68


    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.
     
    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
     
    Source
     
    解题:动态规划
     
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 210010;
     4 int dp[maxn][2],w[maxn],len;
     5 char str[maxn];
     6 int main() {
     7     int kase,cs = 1;
     8     scanf("%d",&kase);
     9     while(kase--) {
    10         scanf("%s",str);
    11         len = strlen(str);
    12         for(int i = 0; i < len; ++i)
    13             scanf("%d",w + i);
    14         memset(dp,-1,sizeof dp);
    15         if(str[0] == '0' || str[0] == '?') dp[0][0] = 0;
    16         if(str[0] == '1' || str[0] == '?') dp[0][1] = w[0];
    17         for(int i = 1; i < len; ++i){
    18             if(str[i] == '1' || str[i] == '?'){
    19                 if(dp[i-1][1] != -1) dp[i][1] = max(dp[i][1],dp[i-1][1]);
    20                 if(dp[i-1][0] != -1) dp[i][1] = max(dp[i][1],dp[i-1][0] + w[i]);
    21             }
    22             if(str[i] == '0' || str[i] == '?'){
    23                 if(dp[i-1][0] != -1) dp[i][0] = max(dp[i][0],dp[i-1][0]);
    24                 if(dp[i-1][1] != -1) dp[i][0] = max(dp[i][0],dp[i-1][1] + w[i]);
    25             }
    26         }
    27         printf("Case #%d: %d
    ",cs++,max(dp[len-1][0],dp[len-1][1]));
    28     }
    29     return 0;
    30 }
    View Code
  • 相关阅读:
    Android studio 克隆分支
    香蕉派 banana pi BPI-M3 八核开源硬件开发板
    Visual F# Power Tools 简单介绍
    win764bit系统plsqldeveloper11连接oracle11g64bit配置方法
    cocos2d-x 模态对话框的实现
    《AndroidStudio每日一贴》2.高速查看项目中近期的变更
    Android百日程序 开篇章:Intent打开网页
    Linux应用server搭建手冊—Weblogic服务域的创建与部署
    HDU 5623 KK's Number(DP)
    JAVA之堆内存和栈内存的差别
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4722121.html
Copyright © 2011-2022 走看看