hdu 2577 How to Type

传送门

How to Type

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

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

 

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2870 2830 2845 1058 2571 

 

16464331

2016-03-07 10:38:54

Accepted

2577

0MS

1564K

1191 B

G++

czy

 

题解：

转自：http://blog.sina.com.cn/s/blog_892d87ff0100u1n5.html

解题报告：题意：输入以字符串，求最少需要敲多少下键盘才能完成输入！开两个数组open[N],close[N],分别记录灯亮时输入第i个字符所敲键盘的次数，灯灭时输入第i个字符时所敲键盘的次数！

 

一开始没想到，可以在大写锁定下，按Shift输入小写，唉，dp的意识还是不强，有待继续训练

 

转移方程：

        if(judge(s[i]) == 1){
            open[i] = min(open[i - 1] + 1,close[i - 1] + 2);
            close[i] = min(open[i - 1] + 2,close[i - 1] + 2);
        }
        else{
            open[i] = min(open[i - 1] + 2,close[i - 1] + 2);
            close[i] = min(open[i - 1] + 2,close[i - 1] + 1);
        }    

 

 

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <stack>
#include <cctype>
#include <vector>
#include <cmath>
#include <map>
#include <queue>

#define ll long long
#define N 10005
#define eps 1e-8

using namespace std;

int T;
int ans;
char s[105];
int l;
int open[105];
int close[105];

int judge(char c)
{
    if(c >= 'A' && c <= 'Z') return 1;
    return 0;
}

void solve()
{
    int i;
    i = 0;
    open[i] = 1;
    close[i] = 0;
    for(i = 1;i <= l;i++){
        if(judge(s[i]) == 1){
            open[i] = min(open[i - 1] + 1,close[i - 1] + 2);
            close[i] = min(open[i - 1] + 2,close[i - 1] + 2);
        }
        else{
            open[i] = min(open[i - 1] + 2,close[i - 1] + 2);
            close[i] = min(open[i - 1] + 2,close[i - 1] + 1);
        }
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d",&T);
    for(int ccnt=1;ccnt<=T;ccnt++){
    //while(scanf("%I64d%I64d",&a,&b)!=EOF){
        scanf("%s",s + 1);
        l = strlen(s + 1);
        solve();
        ans = min(open[l] + 1,close[l]);
        printf("%d\n",ans);
    }
    return 0;
}