#include<iostream>
#include<stdio.h>
#include<cstdio>
using namespace std;
int min(int a,int b)
{
if(a<b)
return a;
return b;
}
int m1[110];
int m2[110];
char mp[110];
int main()
{
freopen("a.in","r",stdin);
int i,t,len,j;
while(scanf("%d",&t)==1)
{
for(i=0;i<t;i++)
{
scanf("%s",mp);
if(isupper(mp[0]))
{
m1[0]=2;
m2[0]=2;
}
else
{
m1[0]=1;
m2[0]=2;
}
len=strlen(mp);
for(j=1;j<len;j++)
{
if(isupper(mp[j]))
{
m1[j]=min(m1[j-1]+2,m2[j-1]+2);
m2[j]=min(m1[j-1]+2,m2[j-1]+1);
}
else
{
m1[j]=min(m1[j-1]+1,m2[j-1]+2);
m2[j]=min(m1[j-1]+2,m2[j-1]+2);
}
}
printf("%d\n",min(m1[len-1],m2[len-1]+1));
}
}
return 0;
}
Font Size: ← →
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
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
<div style='font-family:Times New Roman;font-size:14px;background-color:F4FBFF;border:#B7CBFF 1px dashed;padding:6px'><div style='font-family:Arial;font-weight:bold;color:#7CA9ED;border-bottom:#B7CBFF 1px dashed'><i>Hint</i></div> 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 </div>