Submission #3051451

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

string S;

bool f(int c, int top, int len) {
	for (int i = 0; i < len; i++) {
		if (S[top + i] == c) {
			return true;
		}
	}
	return false;
}

int main(void) {
	int N;

	cin >> N;
	cin >> S;

	int max_num = 0;

	for (int i = 0; i < N; i++) {
		int mid = i + 1;
		int num = 0;
		for (int c = 'a'; c <= 'z'; c++) {
			bool b1 = f(c, 0, mid);
			bool b2 = f(c, mid, N - mid);
			if (b1 && b2) {
				++num;
			}
		}

		if (num > max_num) {
			max_num = num;
		}
	}

	cout << max_num << endl;

	return 0;
}

Submission Info

Judge Result