hdu 2577 How to Type

http://acm.hdu.edu.cn/showproblem.php?pid=2577

关键是处理好边界

dp方程见代码：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <stack>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
int on[105],off[105];
int main()
{
    int T;
    scanf("%d",&T);
    char word[105];
    while(T--)
    {
        scanf("%s",word+1);
        memset(on,0,sizeof(on));
        memset(off,0,sizeof(off));
        int len=strlen(word+1);
        on[0]=1;
        for(int i=1;i<=len;i++)
        {
            if(word[i]>='a'&&word[i]<='z')
            {
                on[i]=min(off[i-1]+2,on[i-1]+2);
                off[i]=min(off[i-1]+1,on[i-1]+2);
            }
            if(word[i]>='A'&&word[i]<='Z')
            {
                on[i]=min(on[i-1]+1,off[i-1]+2);
                off[i]=min(on[i-1]+2,off[i-1]+2);
            }
        }
        printf("%d\n",min(on[len]+1,off[len]));
    }
}