DP-How to Type-2577

How to Type

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


Problem DescriptionPirates 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. 

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

OutputFor each test case, you must output the smallest times of typing the key to finish typing this string. 

Sample Input

3PiratesHDUacmHDUACM

 

Sample Output

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

 

on[i] 表示在大寫開啟時，輸入第i個字元的最小敲鍵數。( on[0]=1, 因為大寫預設關閉，所以第一次輸入前，應該是敲一次開啟 ) 

off[i] 表示在大寫關閉時 . 

如果是當前輸入小寫：

off[i] = min( off[i-1]+1,on[i-1]+2 );

表示，由前一個狀態(off[i-1] 或 on[i-1] ), 輸入當前字元，並要轉化為當前的off狀態，需要的最少敲鍵數。 

#include <iostream>#include <string>using namespace std;int main() {int t;cin >> t;string str;int on[105],off[105];while(t--){cin >> str;int len = str.length();for(int i=0; i<=len; i++){on[i] = 0;off[i] = 0;}on[0] = 1;for(int i=1; i<=len; i++){if(str[i-1] > 'Z'){ //小寫off[i] = min( off[i-1]+1,on[i-1]+2 );on[i] = min(off[i-1]+2, on[i-1]+2);}else{ //大寫off[i] = min( off[i-1]+2,on[i-1]+2 );on[i] = min(off[i-1]+2, on[i-1]+1);}}cout << min(off[len],on[len]+1) << endl;}return 0;}