How to Type
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7246 Accepted Submission(s): 3286
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 8HintThe 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
Recommend
lcy
二维dp 第一位存储的是遍历到哪一个点。
第二位是灯的亮度(暗/灭)
最后一步灯要变暗
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char str[10003];
#define inf 0x3f3f3f3f
int dp[105][2];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%s",str+1);
memset(dp,inf,sizeof(dp));
int len=strlen(str+1);
dp[0][0]=0;
dp[0][1]=1;
for(int i=1;i<=len;i++)
{
if(str[i]>='a'&&str[i]<='z')
{
dp[i][0]=min(dp[i-1][0]+1,dp[i-1][1]+2);
dp[i][1]=min(dp[i-1][0]+2,dp[i-1][1]+2);
}
else {
dp[i][0]=min(dp[i-1][0]+2,dp[i-1][1]+2);
dp[i][1]=min(dp[i-1][1]+1,dp[i-1][0]+2);
}
}
printf("%d\n",min(dp[len][0],dp[len][1]+1));
}
}