Submission #74090948

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

void O_O() {
    int n, l, r;
    string s;
    cin >> n >> l >> r >> s;
    s = "<" + s;

    int pre[26][n + 1];
    memset(pre, 0, sizeof(pre));
    for (int i = 1; i <= n; i++) {
        pre[s[i] - 'a'][i]++;
    }

    for (int i = 0; i < 26; i++) {
        for (int j = 1; j <= n; j++) {
            pre[i][j] += pre[i][j - 1];
        }
    }

    long long ans = 0;
    for (int i = 1; i <= n; i++) {
        int y = max(0, i - l), x = max(0, i - r - 1);
        ans += pre[s[i] - 'a'][y] - pre[s[i] - 'a'][x];
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) {
        O_O();
        if (TC) cout << '\n';
    }

    return 0;
}

Submission Info

Judge Result