http://codeforces.com/problemset/problem/525/A Vitaliy and Pie

从左往右扫过去，没钥匙的话就把答案加一，有钥匙就存一下。

#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define MAX 1005
#define mod 998244353ll
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
int c[30];
int main() {
//  freopen("a.txt", "r", stdin);
//  freopen("b.txt", "w", stdout);
    int n;
    string s;
    cin >> n >> s;
    int ans = 0;
    for (int i = 0; s[i]; ++i) {
        if (i & 1) {
            int t = s[i] - 'A';
            if (c[t]) c[t]--;
            else ans++;
        }
        else {
            int t = s[i] - 'a';
            c[t]++;
        }
    }
    cout << ans << endl;
    return 0;
}