zoukankan      html  css  js  c++  java
  • HDU2577:How to Type(DP)

    Problem Description
    Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some ways, she will type the key at least. But she has a bad habit that if the caps lock is on, she must turn off it, after she finishes typing. Now she wants to know the smallest times of typing the key to finish typing a string.
     
    Input
    The first line is an integer t (t<=100), which is the number of test case in the input file. For each test case, there is only one string which consists of lowercase letter and upper case letter. The length of the string is at most 100.
     
    Output
    For each test case, you must output the smallest times of typing the key to finish typing this string.
     
    Sample Input
    3 Pirates HDUacm HDUACM
     
    Sample Output
    8 8 8
    Hint
    The string “Pirates”, can type this way, Shift, p, i, r, a, t, e, s, the answer is 8. The string “HDUacm”, can type this way, Caps lock, h, d, u, Caps lock, a, c, m, the answer is 8 The string "HDUACM", can type this way Caps lock h, d, u, a, c, m, Caps lock, the answer is 8


     

    题意:要求一个字符串输入,按键盘的最少次数。有Caps Lock和Shift两种转换大小写输入的方式

    思路:用dpa与dpb数组分别记录Caps Lock的开关状态

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    
    char str[111];
    int dpa[111],dpb[111];
    
    int main()
    {
        int t,i,len,flag;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%s",str+1);
            dpa[0] = 0;
            dpb[0] = 1;
            for(i = 1; str[i]; i++)
            {
                if(str[i]>='a' && str[i]<='z')
                {
                    dpa[i] = min(dpa[i-1]+1,dpb[i-1]+2);//若灯亮,则直接按字母;若灯灭,则按字母再开灯
                    dpb[i] = min(dpa[i-1]+2,dpb[i-1]+2);//若灯亮,则要先按字母再关灯;若灯灭,则按shift+字母
                }
                else if(str[i]>='A' && str[i]<='Z')
                {
                    dpa[i] = min(dpa[i-1]+2,dpb[i-1]+2);
                    dpb[i] = min(dpa[i-1]+2,dpb[i-1]+1);
                }
            }
            printf("%d
    ",min(dpb[i-1]+1,dpa[i-1]));//最后要关灯,dpb要+1
        }
    
        return 0;
    }
    


     

  • 相关阅读:
    pagic Deno + React 驱动的静态网站生成器 入门
    antd Form.Item label添加解释信息
    deno可以通过url引入标准库,运行时自动下载,下载到哪里呢
    如何查看github开源项目star趋势
    使用deno开发post请求,get请求,监测文件变化自动重启(类似于nodemon)
    windows安装deno
    react 轮播图 react-slick
    display:flex 元素垂直居中,有间距,右对齐
    Java对map键名进行顺序排序后转为字符串
    IDEA快捷键大全
  • 原文地址:https://www.cnblogs.com/james1207/p/3320064.html
Copyright © 2011-2022 走看看