HDOJ題目2577 How to Type（dp）

How to Type

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4467 Accepted Submission(s): 2034


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
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
 

Author Dellenge
Source HDU 2009-5 Programming Contest
Recommend lcy | We have carefully selected several similar problems for you: 1158 3008 1227 1422 1300

兩個狀態，大寫鎖定開，大寫鎖定關。然後推後一個狀態取最小值即可。

因為這個最後她還要把大寫鎖定給關了，那就需要最後再加一取下大小。

ac代碼

 

#include
#include
#include
#include
#define min(a,b) (a>b?b:a)
char s[110];
int dp[2][110];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",s);
		int len=strlen(s),i;
		if(isupper(s[0]))
		{
			dp[0][0]=2;
			dp[1][0]=2;
		}
		else
		{
			dp[0][0]=1;
			dp[1][0]=2;
		}
		for(i=1;i