\u5bf9\u4e8e\u4e00\u4e2a\u5b57\u7b26\u4e32s
\n\u6709q\u4e2a\u8be2\u95ee\uff0c\u5bf9\u4e8e\u6bcf\u4e2a\u8be2\u95ee\u6709l,r\uff0c\u95ee\u7684\u662f\u5728\u533a\u95f4$[l,r]$\u4e2d\u5b57\u5178\u5e8f\u6700\u5c0f\u5b50\u4e32\u7684\u4e2a\u6570\u3002<\/p>\n
\u6613\u8bc1\u5b57\u5178\u5e8f\u6700\u5c0f\u5b50\u4e32\u4e00\u5b9a\u662f\u4e00\u4e2a\u5b57\u6bcd\uff0c\u4e8e\u662f\u53ea\u9700\u8981\u7edf\u8ba1\u5728[l,r]\u8303\u56f4\u5185\u6700\u5c0f\u7684\u5b57\u6bcd\u51fa\u73b0\u7684\u6b21\u6570\u3002<\/p>\n
\u7531\u4e8e\u6ca1\u6709\u66f4\u65b0\u64cd\u4f5c\uff0c\u6211\u4eec\u53ef\u4ee5\u76f4\u63a5\u5904\u7406\u51fa26\u4e2a\u5b57\u6bcd\u7684\u524d\u7f00\u548c\u3002
\n\u65f6\u95f4\u590d\u6742\u5ea6$\\mathcal O(26 * |S|)$<\/p>\n
\u5982\u679c\u7528\u79bb\u7ebf\u7ef4\u62a4\u67e5\u8be2\u7684\u6700\u5927\u6700\u5c0f\u503c\u6765\u51cf\u5c11\u524d\u7f00\u548c\u7684\u7ef4\u62a4\u6b21\u6570\uff0c\u5728\u8be5\u9898\u7684\u6570\u636e\u8303\u56f4\u8fd8\u53ef\u4ee5\u7701\u4e0b\u4e00\u90e8\u5206\u65f6\u95f4<\/p>\n
\u7528fastio\u53ef\u4ee5\u7701\u90e8\u5206\u8f93\u5165\u8f93\u51fa\u65f6\u95f4\uff0c\u524d\u7f00\u548c\u7528short\u4ee3\u66ffint\u53ef\u4ee5\u7701\u4e00\u90e8\u5206\u7a7a\u95f4\u548c\u65f6\u95f4<\/p>\n
#pragma GCC optimize(\"O3\")\n\n#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <list>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <queue>\n#include <stack>\n#include <set>\n#include <complex>\n\n#define wl(x) while(x)\n#define bl bool\n#define rtn return\n#define ope operator\n#define cst const\n#define it int\n#define cr char\n#define il inline\n#define tpl template\n#define cl class\n#define db double\n#define sf(x) sizeof(x)\ntypedef long long ll;\nusing namespace std;\nconst int INF = 0x3f3f3f3f;\n\n\/*\n * \u8f93\u5165\u6302\n * \u573a\u573aAK buff\n *\/\n\nclass endln {\n};\n\n\nclass iofstream {\nprivate:\n int idx;\n bool eof;\n char buf[100005], *ps, *pe;\n char bufout[100005], outtmp[50], *pout, *pend;\n\n inline void rnext() {\n if (++ps == pe)\n pe = (ps = buf) + fread(buf, sf(cr), sf(buf) \/ sf(cr), stdin), eof = true;\n if (ps == pe)\n eof = false;\n }\n\n inline void write() {\n fwrite(bufout, sf(cr), pout - bufout, stdout);\n pout = bufout;\n }\n\npublic:\n iofstream(char *in = NULL, char *out = NULL) : idx(-1), eof(true) {\n ps = buf, pe = buf + 1;\n pout = bufout, pend = bufout + 100005;\n if (in)\n freopen(in, \"r\", stdin);\n if (out)\n freopen(out, \"w\", stdout);\n }\n\n ~iofstream() {\n write();\n }\n\n tpl<cl T>\n il bl fin(T &ans) {\n#ifdef ONLINE_JUDGE\n ans = 0;\n T f = 1;\n if (ps == pe) {\n eof = false;\n rtn false;\/\/EOF\n }\n do {\n rnext();\n if ('-' == *ps) f = -1;\n } wl(!isdigit(*ps) && ps != pe);\n if (ps == pe) {\n eof = false;\n rtn false;\/\/EOF\n }\n do {\n ans = (ans << 1) + (ans << 3) + *ps - 48;\n rnext();\n } wl(isdigit(*ps) && ps != pe);\n ans *= f;\n#else\n cin >> ans;\n#endif\n rtn true;\n }\n\n tpl<cl T>\n il bl fdb(T &ans) {\n#ifdef ONLINE_JUDGE\n ans = 0;\n T f = 1;\n if (ps == pe) rtn false;\/\/EOF\n do {\n rnext();\n if ('-' == *ps) f = -1;\n } wl(!isdigit(*ps) && ps != pe);\n if (ps == pe) rtn false;\/\/EOF\n do {\n ans = ans * 10 + *ps - 48;\n rnext();\n } wl(isdigit(*ps) && ps != pe);\n ans *= f;\n if (*ps == '.') {\n rnext();\n T small = 0;\n do {\n small = small * 10 + *ps - 48;\n rnext();\n } wl(isdigit(*ps) && ps != pe);\n wl(small >= 1) {\n small \/= 10;\n }\n ans += small;\n }\n#else\n cin >> ans;\n#endif\n rtn true;\n }\n\n\/*\n * \u8f93\u51fa\u6302\n * \u8d85\u5f3a \u8d85\u5feb\n *\/\n\n il bl out_char(cst cr c) {\n#ifdef ONLINE_JUDGE\n *(pout++) = c;\n if (pout == pend) write();\n \/\/write();\n#else\n cout << c;\n#endif\n rtn true;\n }\n\n il bl out_str(cst cr *s) {\n#ifdef ONLINE_JUDGE\n wl(*s) {\n *(pout++) = *(s++);\n if (pout == pend) write();\n }\n \/\/write();\n#else\n cout << s;\n#endif\n rtn true;\n }\n\n tpl<cl T>\n il bl out_double(T x, it idx) {\n char str[50];\n string format = \"%\";\n if (~idx) {\n format += '.';\n format += (char) (idx + '0');\n }\n format += \"f\";\n sprintf(str, format.c_str(), x);\n out_str(str);\n }\n\n tpl<cl T>\n il bl out_int(T x) {\n#ifdef ONLINE_JUDGE\n if (!x) {\n out_char('0');\n rtn true;\n }\n if (x < 0) x = -x, out_char('-');\n it len = 0;\n wl(x) {\n outtmp[len++] = x % 10 + 48;\n x \/= 10;\n }\n outtmp[len] = 0;\n for (it i = 0, j = len - 1; i < j; ++i, --j) swap(outtmp[i], outtmp[j]);\n out_str(outtmp);\n#else\n cout << x;\n#endif\n rtn true;\n }\n\n tpl<cl T>\n il bl out_intln(T x) {\n#ifdef ONLINE_JUDGE\n out_int(x), out_char('\\n');\n \/\/write();\n#else\n cout << x << endl;\n#endif\n rtn true;\n }\n\n tpl<cl T>\n il bl out_doubleln(T x, it idx) {\n out_double(x, idx), out_char('\\n');\n }\n\n il iofstream &ope<<(cst db &x) {\n out_double(x, idx);\n rtn *this;\n }\n\n il iofstream &ope<<(cst it &x) {\n out_int(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst unsigned long long &x) {\n out_int(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst unsigned &x) {\n out_int(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst long &x) {\n out_int(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst ll &x) {\n out_int(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst endln &x) {\n out_char('\\n');\n rtn *this;\n }\n\n\n il iofstream &ope<<(cst cr *x) {\n out_str(x);\n rtn *this;\n }\n\n il iofstream &ope<<(cst string &x) {\n out_str(x.c_str());\n rtn *this;\n }\n\n il iofstream &ope<<(cst char &x) {\n out_char(x);\n rtn *this;\n }\n\n il bl setw(it x) {\n if (x >= 0) {\n idx = x;\n rtn true;\n }\n rtn false;\n }\n\n il iofstream &ope>>(it &x) {\n if (!fin(x))eof = false;\n rtn *this;\n }\n\n il iofstream &ope>>(ll &x) {\n if (!fin(x))eof = false;\n rtn *this;\n }\n\n il iofstream &ope>>(db &x) {\n if (!fdb(x))eof = false;\n rtn *this;\n }\n\n il iofstream &ope>>(float &x) {\n if (!fdb(x))eof = false;\n rtn *this;\n }\n\n il iofstream &ope>>(unsigned &x) {\n if (!fin(x))eof = false;\n rtn *this;\n }\n\n il iofstream &ope>>(unsigned long long &x) {\n if (!fin(x))eof = false;\n rtn *this;\n }\n\n il ope bl() {\n rtn eof;\n }\n\n il cr getchar() {\n#ifdef ONLINE_JUDGE\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn 0;\n }\n rnext();\n if (ps + 1 == pe)\n eof = false;\n rtn *ps;\n#else\n rtn std::getchar();\n#endif\n }\n\n il iofstream &ope>>(char *str) {\n#ifdef ONLINE_JUDGE\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn *this;\n }\n do {\n rnext();\n } wl(isspace(*ps) && iscntrl(*ps) && ps != pe);\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn *this;\n }\n do {\n *str = *ps;\n ++str;\n rnext();\n } wl(!(isspace(*ps) || iscntrl(*ps)) && ps != pe);\n *str = '\\0';\n rtn *this;\n#else\n cin >> str;\n rtn *this;\n#endif\n }\n\n il iofstream &ope>>(string &str) {\n#ifdef ONLINE_JUDGE\n str.clear();\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn *this;\n }\n do {\n rnext();\n } wl(isspace(*ps) && iscntrl(*ps) && ps != pe);\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn *this;\n }\n do {\n str += *ps;\n rnext();\n } wl(!(isspace(*ps) || iscntrl(*ps)) && ps != pe);\n rtn *this;\n#else\n cin >> str;\n rtn *this;\n#endif\n }\n\n il iofstream &getline(char *str) {\n#ifdef ONLINE_JUDGE\n if (ps == pe) {\n eof = false;\/\/EOF\n rtn *this;\n }\n do {\n rnext();\n *str = *ps;\n } while (*ps != '\\n' && ps != pe && str++);\n *str = '\\0';\n rtn *this;\n#else\n gets(str);\n rtn *this;\n#endif\n }\n\n il bl endfile() {\n rtn eof;\n }\n};\n\nstatic iofstream fin;\nstatic endln ln;\nusing namespace std;\nconst int maxn = 1e5 + 6;\nshort bin[26][maxn];\nchar s[maxn];\npair<int, int> qu[maxn];\n\nint main() {\n int T;\n fin >> T;\n int n, q;\n for (int kase = 1;kase <= T;++kase) {\n fin << \"Case #\" << kase << \":\" << \"\\n\" >> n >> q >> s;\n int mx = -1, mn = INF;\n for (int i = 0; i < q; ++i) {\n fin >> qu[i].first >> qu[i].second;\n mx = max(mx, qu[i].second);\n mn = min(mn, qu[i].first);\n }\n for (int i = mn - 1; i < mx; ++i) {\n for (auto &j : bin) {\n j[i + 1] = j[i];\n }\n ++bin[s[i] - 'A'][i + 1];\n }\n for (int i = 0; i < q; ++i) {\n int tot = 0;\n for (auto j : bin) {\n tot = j[qu[i].second] - j[qu[i].first - 1];\n if (tot)break;\n }\n fin << tot << \"\\n\";\n }\n\n }\n}\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u9898\u610f \u5bf9\u4e8e\u4e00\u4e2a\u5b57\u7b26\u4e32s \u6709q\u4e2a\u8be2\u95ee\uff0c\u5bf9\u4e8e\u6bcf\u4e2a\u8be2\u95ee\u6709l,r\uff0c\u95ee\u7684\u662f\u5728\u533a\u95f4$[l,r]$\u4e2d\u5b57\u5178\u5e8f\u6700\u5c0f\u5b50\u4e32\u7684\u4e2a\u6570\u3002 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","footnotes":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false},"categories":[39,22],"tags":[],"class_list":["post-417","post","type-post","status-publish","format-standard","hentry","category-c","category-22"],"jetpack_featured_media_url":"","jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p8UC2c-6J","jetpack_likes_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/417","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=417"}],"version-history":[{"count":0,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/417\/revisions"}],"wp:attachment":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=417"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=417"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=417"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}