两种状态分别DP+分类讨论(2577)

How to Type

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

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
   
   
  
  

技巧在于对于两种状态分别DP，记输入完第i个字符状态为开/关的最小按键数为on[i]/off[i]，分类讨论列出DP方程。

另外，在CapsLock开启状态下，Shift+字母为小写(平时不常用，没有关注到这个问题)。

/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
#define MOD 10E9+7
/*---------------------Work-----------------------*/
char s[120];
int on[120],off[120];
void work()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",s);
		int len=strlen(s);
		on[0]=1,off[0]=0;
		for(int i=1;i<=len;i++)
		{
			if(s[i-1]<='Z')
			{
				on[i]=min(on[i-1]+1,off[i-1]+2);
				off[i]=min(on[i-1]+2,off[i-1]+2);
			}
			else
			{
				on[i]=min(on[i-1]+2,off[i-1]+2);
				off[i]=min(on[i-1]+2,off[i-1]+1);
			}
		}
		printf("%d\n",off[len]);
	}
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	//freopen("cowtour.out","w",stdout);
	//freopen("cowtour.in","r",stdin);
	work();
	return 0;
}