HDU - 2577 动态规划

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.

这道题的主要意思是输入一个包含大小写字母的字符串，输出输入这个字符串所需要最好的按键次数。值得注意的是有些人可能不知道在大写按键打开的情况下，按shift+字母也是可以输入小写字母的。

这道题可以分为两种情况，
一种是输入后还是处于大写状态，一种是输入后处于小写状态，用两个动态方程，然后取较小的那一个。

#include <iostream>
#include<algorithm>
#include<string>
using namespace std;
int on[105], off[105]//分别是输入一个字母后还是大写，小写状态
 
int main()
{
    int n;
    cin>> n;
    while (n--)
    {
         on[0]= 1;//打开大写开关，所以加一
         string a;
         cin>> a;
         int b = a.size();
         for (int i = 0; i < b；i++)
         {
             if ('a' <= a[i] && a[i] <= 'z')
             {
                  on[i + 1] = min(on[i] + 2, off[i] + 2);
                  off[i+ 1] = min(on[i] + 2, off[i] + 1);
             }
             else
             {
                  on[i+ 1] = min(on[i] + 1, off[i] + 2);
                  off[i+ 1] = min(on[i] + 2, off[i] + 2);
             }
 
         }
         cout<< min(on[b] + 1,off[b]) << endl;
    }
    return 0;
}