HDOJ--2577--How to Type

题目描述：
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.
输入描述:
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.
输出描述:
For each test case, you must output the smallest times of typing the key to finish typing this string.
输入：
abcfbc abfcab
programming contest
abcd mnp
输出：
8
8
8
题意：
要求一个字符串输入，求按键盘的最少次数。有Caps Lock和Shift两种转换大小写输入的方式
题解：
dpa表示现在灯是灭的，dpb表示现在灯是亮的
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 1000 + 5;
char s[maxn];
int dpa[maxn],dpb[maxn];

int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        memset(dpa,0,sizeof(dpa));
        memset(dpb,0,sizeof(dpb));
        scanf("%s",s + 1);
        int l = strlen(s + 1);
        dpa[0] = 0;
        dpb[0] = 1;
        //dpa表示现在灯是灭的，dpb表示现在灯是亮的
        for(int i = 1; i <= l; i ++){
            if(s[i] >= 'a' && s[i] <= 'z'){
                dpa[i] = min((dpa[i - 1] + 1),(dpb[i - 1] + 2));
                dpb[i] = min((dpa[i - 1] + 2),(dpb[i - 1] + 2));
            }
            else if(s[i] >= 'A' && s[i] <= 'Z'){
                dpa[i] = min((dpa[i - 1] + 2),(dpb[i - 1] + 2));
                dpb[i] = min((dpa[i - 1] + 2),(dpb[i - 1] + 1));
            }
        }
        int ans = min(dpa[l],dpb[l] + 1);
        printf("%d\n",ans);
    }
    return 0;
}