提出 #74121104

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;
using ll = long long;


int main() {
	int N, L, R;
	cin >> N >> L >> R;
	string S;
	cin >> S;

	ll ans = 0;
	vector<vector<int>> T(26);

	for (int i = 0; i < N; i++) {
		int j = S[i] - 'a';
		T[j].push_back(i);
	}

	for (int i = 0; i < 26; i++) {
		for (int j = 0; j < (int)(T[i].size()) - 1; j++) {
			auto right = lower_bound(T[i].begin(), T[i].end(), T[i][j] + R);
			auto left = lower_bound(T[i].begin(), T[i].end(), T[i][j] + L);

			if (left == T[i].end())continue;

			int siz = right - left;
			siz += 1;
			if (right == T[i].end())siz -= 1;
			else if (*right - T[i][j] > R)continue;

			ans += siz;
		}
	}
	
	cout << ans << endl;
	return 0;
} 

提出情報

ジャッジ結果