AtCoder Beginner Contest 098
翻译中…
Problem Statement
翻译中…
You are given a string $S$ of length $N$ consisting of lowercase English letters. We will cut this string at one position into two strings $X$ and $Y$. Here, we would like to maximize the number of different letters contained in both $X$ and $Y$. Find the largest possible number of different letters contained in both $X$ and $Y$ when we cut the string at the optimal position.
翻译中…
Constraints
翻译中…
$2 \leq N \leq 100$$|S| = N$$S$consists of lowercase English letters.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
S翻译中…
Output
翻译中…
Print the largest possible number of different letters contained in both $X$ and $Y$.
翻译中…
样例
Input #1
6
aabbca
Output #1
2
If we cut the string between the third and fourth letters into $X =$ `aab` and $Y =$ `bca`, the letters contained in both $X$ and $Y$ are `a` and `b`. There will never be three or more different letters contained in both $X$ and $Y$, so the answer is $2$.
Input #2
10
aaaaaaaaaa
Output #2
1
However we divide $S$, only `a` will be contained in both $X$ and $Y$.
Input #3
45
tgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir
Output #3
9
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。