Codeforces Round #116 (Div. 2, C. Letter

Patrick has just finished writing a message to his sweetheart Stacey when he noticed that the message didn't look fancy. Patrick was nervous while writing the message, so some of the letters there were lowercase and some of them were uppercase.

Patrick believes that a message is fancy if any uppercase letter stands to the left of any lowercase one. In other words, this rule describes the strings where first go zero or more uppercase letters, and then — zero or more lowercase letters.

To make the message fancy, Patrick can erase some letter and add the same letter in the same place in the opposite case (that is, he can replace an uppercase letter with the lowercase one and vice versa). Patrick got interested in the following question: what minimum number of actions do we need to make a message fancy? Changing a letter's case in the message counts as one action. Patrick cannot perform any other actions.

Input

The only line of the input contains a non-empty string consisting of uppercase and lowercase letters. The string's length does not exceed 105.

Output

Print a single number — the least number of actions needed to make the message fancy.

题意:

只有大写变小写，小写变大写的操作。

问左边变成都是大写字母，右边都变成小写字母最少的操作。

思路：

统计每个位置及之前有多少个大写字母，然后遍历每个位置找出最小值即可。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define INF 0x3f3f3f3f
#define LL long long

using namespace std;
const int maxn=1e5+100;
char s[maxn];
int hight[maxn];
int main()
{
    scanf("%s",s+1);
    int len=strlen(s+1);
    for(int i=1;i<=len;i++)
    {
        hight[i]=hight[i-1];
        if('A'<=s[i]&&s[i]<='Z')
        {
            hight[i]++;
        }
    }
    int ans=INF;
    for(int i=0;i<=len;i++)
    {
        ans=min(ans,i-hight[i]+(hight[len]-hight[i]));
    }
    printf("%d\n",ans);
    return 0;
}