E - 5 HDU - 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.
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

问题链接：https://vjudge.net/contest/279617#problem/E

问题分析：
假设我们当前字符i需要大写：对于i输入完后，有两种状态，一种是大写，一种是小写。
dp[i + 1][1] = min(dp[i][0] + 2, dp[i][1] + 1); / /写完后大写。
dp[i + 1][0] = min(dp[i][0] + 2, dp[i][1] + 2); //写完后小写

当前是需要小写
dp[i + 1][1] = min(dp[i][0] + 2, dp[i][1] + 2); //写完大写。
dp[i + 1][0] = min(dp[i][0] + 1, dp[i][1] + 2); //写完小写

AC代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int dp[101][2];
	char a[101];
	int n;
	cin >> n;
	while (n--)
	{
		int i = 0;
		cin >> a;
		dp[0][1] = 1;
		dp[0][0] = 0;
		for (i = 0; a[i] != '\0'; i++)
		{
			if (a[i] >= 'A'&&a[i] <= 'Z')
			{
				dp[i + 1][1] = min(dp[i][0] + 2, dp[i][1] + 1);
				dp[i + 1][0] = min(dp[i][0] + 2, dp[i][1] + 2);
			}
			else
			{
				dp[i + 1][1] = min(dp[i][0] + 2, dp[i][1] + 2);
				dp[i + 1][0] = min(dp[i][0] + 1, dp[i][1] + 2);
			}
		}
		int h = min(dp[i][1]+1, dp[i][0]);
		cout << h << endl;
	}
	return 0;
}