hdu 2577

最新推荐文章于 2019-02-28 19:00:39 发布

转载最新推荐文章于 2019-02-28 19:00:39 发布 · 207 阅读

74 篇文章

订阅专栏

#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define REP(i,a,b) for (i=(a);i<=(b);i++)
#define CLEAR(a) memset((a),0,sizeof((a)))

using namespace std;

typedef long long LL;
const double pi = acos(-1.0);
const int maxn = 150;

void init();
void solve();
void outp();

char str[maxn + 1];
int dp1[maxn + 1], dp2[maxn + 1];
int k;


int main()
{
    int t;
    while (~scanf("%d", &t))
        while (t--)
        {
            init();
            solve();
            outp();
        }
    return 0;
}

void init()
{
    CLEAR(dp1);
    CLEAR(dp2);
    scanf("%s", str + 1);
    dp1[0] = 0;
    dp2[0] = 1;
}

void solve()
{
    for (int i = 1; str[i]; i++)
    {
        if (str[i] >= 'a' && str[i] <= 'z')
        {
            dp1[i] = min(dp1[i - 1] + 1, dp2[i - 1] + 2);
            dp2[i] = min(dp1[i - 1] + 2, dp2[i - 1] + 2);
        }
        else if (str[i] >= 'A' && str[i] <= 'Z')
        {
            dp1[i] = min(dp1[i - 1] + 2, dp2[i - 1] + 2);
            dp2[i] = min(dp1[i - 1] + 2, dp2[i - 1] + 1);
        }
        k = i;
    }
}

void outp()
{
    printf("%d\n", min(dp1[k], dp2[k] + 1));
}