HDU 2577 How to Type（dp题）

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<iostream>
 5 #include<cmath>
 6 #include<deque>
 7 #include<map>
 8 #include<queue>
 9 #include<cstdlib>
10 using namespace std;
11 const int maxn = 105;
12 char str[maxn];
13 int dp[maxn];
14 int judge1(int x,int y)
15 {
16     int sum = 2;
17     for(int i = x;i <= y;++i)
18     if(str[i] >= ‘A‘ && str[i] <= ‘Z‘)
19     sum++;
20     else if(str[i] >= ‘a‘ && str[i] <= ‘z‘)
21     sum += 2;
22     return sum;
23 }
24 int judge2(int x,int y)
25 {
26     int sum = 0;
27     for(int i = x;i <= y;++i)
28     if(str[i] >= ‘A‘ && str[i] <= ‘Z‘)
29     sum += 2;
30     else if(str[i] >= ‘a‘ && str[i] <= ‘z‘)
31     sum++;
32     return sum;
33 }
34 int main()
35 {
36     int T;
37     scanf("%d",&T);
38     while(T--)
39     {
40         scanf("%s",str+1);
41         int len = strlen(str+1);
42         memset(dp,0x3f,sizeof(dp));
43         dp[0] = 0;    //使0号为0，后面要-1，不用做特殊处理 
44         for(int i = 1;i <= len;++i)
45         for(int j = 1;j <= i;++j)
46         {
47             dp[i] = min(dp[i],dp[j-1] + judge1(j,i));
48             dp[i] = min(dp[i],dp[j-1] + judge2(j,i));
49         }
50         printf("%d\n",dp[len]);
51     }
52     return 0;
53 }