Codeforces Round #436 (Div. 2)B - Polycarp and Letters

http://codeforces.com/contest/864/problem/B

Description

Polycarp loves lowercase letters and dislikes uppercase ones. Once he got a string s consisting only of lowercase and uppercase Latin letters.

Let A be a set of positions in the string. Let’s call it pretty if following conditions are met:

letters on positions from A in the string are all distinct and lowercase;
there are no uppercase letters in the string which are situated between positions from A (i.e. there is no such j that s[j] is an uppercase letter, and a1 < j < a2 for some a1 and a2 from A).
Write a program that will determine the maximum number of elements in a pretty set of positions.

Input

The first line contains a single integer n (1 ≤ n ≤ 200) — length of string s.

The second line contains a string s consisting of lowercase and uppercase Latin letters.

Output

Print maximum number of elements in pretty set of positions for string s.

Sample Input

Input

11
aaaaBaabAbA

Output

2

Input

12
zACaAbbaazzC

Output

3

Input

3
ABC

Output

0

Hint

In the first example the desired positions might be 6 and 8 or 7 and 8. Positions 6 and 7 contain letters ‘a’, position 8 contains letter ‘b’. The pair of positions 1 and 8 is not suitable because there is an uppercase letter ‘B’ between these position.

In the second example desired positions can be 7, 8 and 11. There are other ways to choose pretty set consisting of three elements.

In the third example the given string s does not contain any lowercase letters, so the answer is 0.

题意

求连续的小写子母中，种类最多的是多少种。

思路

首先遍历所有的元素，从小写字母往后遍历知道结束或遇到大写字母，如果遇到之前遍历到的字母不计次数，所以我们要给遍历过的字母一个标记，所以用到了hash表。
不要忘记每次初始化hash表。

CODE

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int f(char c)
{
    if(c<='Z'&&c>='A')
        return 0;
    else
        return 1;
}
int main()
{
    int n,count=0,ans=-1;
    int flag[50];
    cin >> n;
    getchar();
    char a[200];
    for(int i=0;i<n;i++)
        scanf("%c",&a[i]);
    for(int i=0;i<n;i++)
    {
        memset(flag,0,sizeof(flag));
        count=0;
        for(int j=i;j<n;j++)
        {
            if(!f(a[j]))
                break;
            else if(flag[a[j]-'a']==0)
            {
                flag[a[j]-'a']=1;
                count++;
            }
        }
        ans=max(ans,count);
    }
    cout << ans << endl;
}