HOJ 2577 How to Type(dp)

最新推荐文章于 2021-03-15 22:54:44 发布

原创最新推荐文章于 2021-03-15 22:54:44 发布 · 315 阅读

0 ·

CC 4.0 BY-SA版权

普通dp 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一款由海盗开发的打字软件，并通过具体案例分析了如何最小化按键次数完成字符串输入，包括考虑大小写锁定状态的影响。

How to Type

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7314 Accepted Submission(s): 3321

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

Author

Dellenge

Source

HDU 2009-5 Programming Contest

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 300;
using ll = long long;
ll dp[2][maxn];
// 是否已经按下caps键，第几个数
int main() {
    //freopen("in.txt", "r", stdin);
    int t;
    cin >> t;
    string str;
    while (t--) {
        memset(dp, 0, sizeof(dp));
        cin >> str;
        dp[1][0] = 1;
        str.insert(str.begin(), ' ');
        for (int i = 1; i < str.length(); ++i) {
            if (str[i] >= 'A' && str[i] <= 'Z') {
                                //shit + alph,   alph + caps
                dp[0][i] = min(dp[0][i - 1] + 2, dp[1][i - 1] + 2);
                                // alph          caps + alph
                dp[1][i] = min(dp[1][i - 1] + 1, dp[0][i - 1] + 2);
            } else {            //alph           caps + alph
                dp[0][i] = min(dp[0][i - 1] + 1, dp[1][i - 1] + 2);
                                // alph + caps,  shit + alph
                dp[1][i] = min(dp[0][i - 1] + 2, dp[1][i - 1] + 2);
            }
        }
        cout << min(dp[0][str.length() - 1], dp[1][str.length() - 1] + 1) << endl;
    }
}