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): 3715    Accepted Submission(s): 1705

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

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
 

 

Author

Dellenge

 

Source

HDU 2009-5 Programming Contest

解题思路：简单DP，dp[0][i]表示打到第i个字母时大写锁定关闭的最小按键次数，dp[1][i]表示打到第i个字母时大写锁定开启的最小按键次数，然后记得打最后一个字母时，若大写锁定开启要记得关闭即可

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <set>#include <map>#include <list>#include <queue>#include <stack>#include <deque>#include <vector>#include <bitset>#include <cmath>#include <utility>#define Maxn 100005#define Maxm 1000005#define lowbit(x) x&(-x)#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define PI acos(-1.0)#define make_pair MP#define LL long long #define Inf (1LL<<62)#define inf 0x3f3f3f3f#define re freopen("in.txt","r",stdin)#define wr freopen("out.txt","w",stdout)using namespace std;int dp[2][105];int main(){    int n,t;    char str[105];    re;wr;    scanf("%d",&t);    while(t--)    {        memset(dp,0,sizeof(dp));        memset(str,'\0',sizeof(str));        scanf("%s",str);        int len=strlen(str);        if(str[0]>='a'&&str[0]<='z')        {            dp[0][0]=1;            dp[1][0]=2;        }        else        {            dp[0][0]=2;            dp[1][0]=2;        }        for(int i=1;i<len;i++)        {            if(str[i]>='a'&&str[i]<='z')            {                dp[0][i]=min(dp[0][i-1]+1,dp[1][i-1]+2);                dp[1][i]=min(dp[0][i-1]+3,dp[1][i-1]+2);            }            else            {                dp[0][i]=min(dp[0][i-1]+2,dp[1][i-1]+3);                dp[1][i]=min(dp[0][i-1]+2,dp[1][i-1]+1);            }            if(i==len-1)                dp[1][i]++;        }        printf("%d\n",min(dp[0][len-1],dp[1][len-1]));    }    return 0;}