【HDU 2577】How to Type

来源:互联网 发布:哈登16 17赛季数据 编辑:程序博客网 时间:2024/06/08 10:57

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
3PiratesHDUacmHDUACM
Sample Output
888          
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 8The string "HDUACM", can type this way Caps lock h, d, u, a, c, m, Caps lock, the answer is 8         


/*    dp[0][i]:大写标记关闭    dp[1][i]:大写标记开启*/#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<cstdio>#include<queue>#include<vector>using namespace std;const int MX = 105;char s[MX];int dp[2][MX];int main(){    int T;    scanf("%d", &T);    while(T--)    {        scanf("%s", s + 1);        memset(dp, 0, sizeof(dp));        dp[0][0] = 0;        dp[1][0] = 1;        for(int i = 1; i <= strlen(s + 1); i++)        {            if(s[i] >= 'a' && s[i] <= 'z')            {                dp[0][i] = min(dp[0][i - 1] + 1, dp[1][i - 1] + 2);                dp[1][i] = min(dp[0][i - 1] + 2, dp[1][i - 1] + 2);            }            else if(s[i] >= 'A' && s[i] <= 'Z')            {                dp[0][i] = min(dp[0][i - 1] + 2, dp[1][i - 1] + 2);                dp[1][i] = min(dp[0][i - 1] + 2, dp[1][i - 1] + 1);            }        }        cout<<min(dp[0][strlen(s + 1)], dp[1][strlen(s + 1)] + 1)<<endl;            //最后要关闭标记,所以若是标记开启,还要额外加一    }    return 0;}




原创粉丝点击