{"id":710,"date":"2020-07-26T08:40:46","date_gmt":"2020-07-26T00:40:46","guid":{"rendered":"http:\/\/www.zyhcoding.club\/?p=710"},"modified":"2020-07-27T20:38:00","modified_gmt":"2020-07-27T12:38:00","slug":"%e5%8f%af%e6%8c%81%e4%b9%85%e5%8c%96%e7%ba%bf%e6%ae%b5%e6%a0%91","status":"publish","type":"post","link":"http:\/\/www.zyhcoding.club\/index.php\/2020\/07\/26\/%e5%8f%af%e6%8c%81%e4%b9%85%e5%8c%96%e7%ba%bf%e6%ae%b5%e6%a0%91\/","title":{"rendered":"\u53ef\u6301\u4e45\u5316\u7ebf\u6bb5\u6811–\u4e3b\u5e2d\u6811"},"content":{"rendered":"

\u521d\u6b21\u63a5\u89e6\u4e3b\u5e2d\u6811\uff0c\u8fd8\u6ca1\u6709\u627e\u5230\u5f88\u597d\u7684\u677f\u5b50\uff0c\u5c31\u81ea\u5df1\u5148\u778e\u5199\u4e86\u4e00\u6bb5\uff0c\u5e38\u6570\u6709\u70b9\u5927\u3002\u90a3\u5c31\u5148\u8bf4\u4e24\u53e5\u4e3b\u5e2d\u6811\u7684\u601d\u60f3\u3002<\/p>\n

\u4e3b\u5e2d\u6811<\/h3>\n

\u4e3b\u5e2d\u6811\uff0c\u53c8\u79f0\u51fd\u6570\u5f0f\u7ebf\u6bb5\u6811\uff0c\u652f\u6301\u8bbf\u95ee\u7ebf\u6bb5\u6811\u7684\u5386\u53f2\u7248\u672c\uff0c\u53ef\u4ee5\u6709\u81ea\u5b9a\u4e49\u4e2a\u7248\u672c\u7684\u5b8c\u6574\u7684\u7ebf\u6bb5\u6811\uff0c\u4e3b\u5e2d\u6811\u5229\u7528\u8fd9\u4e9b\u7ebf\u6bb5\u6811\u4e4b\u95f4\u7684\u5171\u540c\u6570\u636e\u6765\u51cf\u5c11\u7a7a\u95f4\u6d88\u8017\u548c\u65f6\u95f4\u8bbf\u95ee\u3002
\n\u4e3b\u5e2d\u6811\u672c\u8d28\u4e0a\u5c31\u662f\u7ebf\u6bb5\u6811\uff0c\u5b83\u4e0d\u4ec5\u80fd\u591f\u8bbf\u95ee\u5f53\u524d\u7248\u672c\u7ebf\u6bb5\u6811\u7684\u72b6\u6001\uff0c\u540c\u65f6\u8fd8\u80fd\u56de\u53bb\u8bbf\u95ee\u67d0\u4e2a\u5386\u53f2\u7248\u672c\u7684\u72b6\u6001\uff0c\u5e76\u5728\u5176\u4e0a\u505a\u51fa\u6539\u53d8\uff0c\u8fd8\u80fd\u518d\u6b21\u4fdd\u5b58\u6539\u53d8\u540e\u7684\u72b6\u6001\uff0c\u5b9e\u73b0\u53ef\u6301\u4e45\u5316\u3002
\n\u56e0\u4e3a\u6bcf\u6b21\u4fee\u6539\u67d0\u4e2a\u5386\u53f2\u7248\u672c\u7684\u5355\u70b9\u503c\uff0c\u53ea\u9700\u6539\u53d8\u4ece\u8be5\u53f6\u5b50\u7ed3\u70b9\u5230\u6839\u8282\u70b9\u7684logn\u4e2a\u7ed3\u70b9\u7684\u503c\uff0c\u6240\u4ee5\u4e5f\u5c31\u53ea\u9700\u8981\u65b0\u5efalogn\u4e2a\u7ed3\u70b9\u5c31\u53ef\u521b\u5efa\u4e00\u4e2a\u65b0\u7684\u7ebf\u6bb5\u6811\u3002
\n\u4e3a\u4e86\u8282\u7701\u7a7a\u95f4\uff0c\u6570\u636e\u6c60\u7ed3\u6784\u4f53\u7ed3\u70b9\u91cc\u4e0d\u518d\u4fdd\u5b58\u533a\u95f4\u4fe1\u606f[l, r]\uff0c\u800c\u662f\u4f5c\u4e3a\u9012\u5f52\u53c2\u6570\u4f20\u9012(MLE\u4e86\u597d\u4e45)<\/strong>
\n\u81f3\u4e8e\u6570\u636e\u6c60\u7684\u5927\u5c0f\uff0c\u662fmaxn\u768420\u500d\u5de6\u53f3\u5373\u53ef(logn\u500d)\u3002
\n\u5f53\u524d\u4f7f\u7528\u7684\u4e3b\u5e2d\u6811\u677f\u5b50\u91cc\u7684\u53d8\u91cf\uff1a<\/p>\n

\n

tree[]: \u7ed3\u70b9(\u7ed3\u6784\u4f53)\u6570\u7ec4\uff0c\u6570\u636e\u6c60\uff0c\u4f7f\u7528\u65b0\u7ed3\u70b9\u65f6\u4ece\u8fd9\u91cc\u9762\u62ff\uff0c\u8fd9\u91cc\u9762\u7684\u7ed3\u70b9\u53ef\u80fd\u662f\u6839\u8282\u70b9\uff0c\u4e5f\u53ef\u80fd\u662f\u53f6\u5b50\u8282\u70b9\u7b49\u5404\u79cd\u7ed3\u70b9\u3002
\nroot[i]: \u7248\u672ci\u7684\u6811\u6839\u5728tree[]\u4e2d\u7684\u4f4d\u7f6e(\u4e0b\u6807)\u3002
\n\u7ed3\u70b9\u91cc\u53ea\u4fdd\u5b58\u5176\u5de6\u53f3\u5b69\u5b50\u7684\u4f4d\u7f6e\u548c\u533a\u95f4\u4fe1\u606f\uff0c\u6ca1\u6709\u7236\u4eb2\u7ed3\u70b9\uff0c\u56e0\u4e3a\u4e00\u4e2a\u7ed3\u70b9\u53ef\u80fd\u6709\u591a\u4e2a\u7236\u4eb2\u7ed3\u70b9\uff0c\u662f\u591a\u4e2a\u7ebf\u6bb5\u6811\u7248\u672c\u7684\u4e00\u90e8\u5206\u3002<\/p>\n<\/blockquote>\n

P3919 \u3010\u6a21\u677f\u3011\u53ef\u6301\u4e45\u5316\u7ebf\u6bb5\u6811<\/a>
\n\u5148\u770b\u4e00\u9053\u6700\u6700\u57fa\u7840\u7684\u677f\u5b50\u3002\u9996\u5148\u5728\u521d\u59cb\u6570\u7ec4\u4e0a\u5efa\u7acb\u7248\u672c\u7f16\u53f7\u4e3a0\u7684\u7ebf\u6bb5\u6811\uff0c\u6b64\u540e\u6bcf\u4e00\u6b21\u6539\u53d8\u503c\uff0c\u5efa\u7acb\u65b0\u7684\u7ebf\u6bb5\u6811\uff0c\u90fd\u9700\u8981\u4ece\u6839\u8282\u70b9\u5f00\u59cb\u5230\u53f6\u5b50\u7ed3\u70b9\u5171\u65b0\u5efalogn(\u6811\u9ad8)\u4e2a\u7ed3\u70b9\u3002\u8bbf\u95ee\u7ebf\u6bb5\u6811\u65f6\u5c31\u662f\u7528\u666e\u901a\u7ebf\u6bb5\u6811\u7684\u8bbf\u95ee\u65b9\u5f0f\u5373\u53ef\uff0c\u53ea\u9700\u8981\u6709\u4e00\u4e2a\u6811\u6839\u5c31\u53ef\u8bbf\u95ee\u8be5\u7ebf\u6bb5\u6811\uff0c\u8bbf\u95ee\u548c\u66f4\u65b0\u53f6\u5b50\u8282\u70b9\u503c\u90fd\u662f\u4ece\u4e0a\u5f80\u4e0b\u8bbf\u95ee\u3002<\/p>\n

#include <bits\/stdc++.h>\nusing namespace std;\nconst int maxn = 1e6+5;\nstruct tree{\n    int left, right, val;             \/\/\u5de6\u53f3\u5b69\u5b50\n    int l, r;           \/\/\u533a\u95f4\n}tree[maxn*15];\nint n, m;\nint top, cur;                   \/\/top\u8868\u793atree\u7ed3\u70b9\u7684\u4f7f\u7528\u60c5\u51b5\uff0ccur\u8868\u793a\u5f53\u524d\u7ebf\u6bb5\u6811\u7248\u672c\u7684\u7f16\u53f7\nint nums[maxn];\nint root[maxn];\ninline int build(int l, int r){                \/\/\u533a\u95f4[l, r]  \u521b\u5efa\u7ed3\u70b9\u6765\u5b58\u50a8\u533a\u95f4[l,r]\u540c\u65f6\u8fd4\u56de\u8be5\u7ed3\u70b9\u7684\u4e0b\u6807\n    int cur = ++top;\n    tree[cur].l = l, tree[cur].r = r;\n    if (l==r){\n        tree[cur].val = nums[l];\n        return cur;\n    }\n    int mid = (l+r)>>1;\n    tree[cur].left = build(l, mid);\n    tree[cur].right = build(mid+1, r);\n    return cur;\n}\ninline int add(int src, int target_idx, int val){        \/\/\u5728src\u7ed3\u70b9\u91cc\u5bfb\u627etarget\u5e76\u4fee\u6539\u503c\u4e3aval\uff0c\u540c\u65f6\u8fd4\u56de\u7ed3\u70b9\u4e0b\u6807\n    int cur = ++top;\n    tree[cur].l = tree[src].l, tree[cur].r = tree[src].r;\n    if (tree[src].l == tree[src].r){\n        tree[cur].val = val;\n        return cur;\n    }\n    if (target_idx <= tree[tree[src].left].r){\n        tree[cur].left = add(tree[src].left, target_idx, val);\n        tree[cur].right = tree[src].right;\n    }else{\n        tree[cur].right = add(tree[src].right, target_idx, val);\n        tree[cur].left = tree[src].left;\n    }\n    return cur;\n}\ninline int search(int src, int target_idx){\n    if (tree[src].l == tree[src].r){\n        return tree[src].val;\n    }\n    if (target_idx <= tree[tree[src].left].r)   return search(tree[src].left, target_idx);\n    else    return search(tree[src].right, target_idx);\n}\ninline int read(){\n    int x=0, f=1;\n    char ch = getchar();\n    while (ch<'0' || ch>'9'){\n        if (ch=='-')    f = -1;\n        ch = getchar();\n    }\n    while (ch>='0' && ch<='9'){\n        x = x*10 + ch-'0';\n        ch = getchar();\n    }\n    return x*f;\n}\nint main(){\n    int edi, opt, loc, val;\n    cur = top = 0;\n    \/\/scanf ("%d %d", &n, &m);\n    n = read(), m = read();\n    for (int i=1; i<=n; i++)    nums[i] = read();\/\/scanf ("%d", nums+i);\n    root[cur++] = build(1, n);\n    for (int i=1; i<=m; i++){\n        \/\/scanf ("%d %d", &edi, &opt);\n        edi = read(), opt = read();\n        if (opt&1){\n            \/\/scanf ("%d %d", &loc, &val);\n            loc = read(), val = read();\n            root[cur++] = add(root[edi], loc, val);\n        }else{\n            \/\/scanf ("%d", &loc);\n            loc = read();\n            root[cur++] = root[edi];\n            printf ("%d\\n", search(root[edi], loc));\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n
P3834 \u3010\u6a21\u677f\u3011\u53ef\u6301\u4e45\u5316\u7ebf\u6bb5\u6811 2\uff08\u4e3b\u5e2d\u6811\uff09<\/a>
\n\u7b2ck\u5c0f\u6570\u5b57<\/p>\n
#include <cstdio>\n#include <algorithm>\nusing namespace std;\nconst int maxn = 2e5+5;\nstruct num{\n    int val, idx;\n    int ser;\n}nums[maxn];\nint n, m;\nint ser[maxn];\n\nstruct tree{\n    int left, right, val;                        \/\/val\u4e3a\u533a\u95f4\u5185\u503c\u7684\u4e2a\u6570\n    int l, r;\n}tree[maxn*30];                       \/\/\u6570\u636e\u6c60\nint top;                              \/\/\u6570\u636e\u6c60\u7684\u4f7f\u7528\u4fe1\u606f\nint root[maxn];                       \/\/\u5b58\u50a8\u5404\u4e2a\u7248\u672c\u7684\u6839\u7684\u4f4d\u7f6e(\u6570\u636e\u6c60\u4e2d\u7684\u4e0b\u6807)\n\ninline int build(int l, int r){              \/\/\u5efa\u7acb\u521d\u59cb\u7a7a\u6811\n    int tmp = ++top;\n    tree[tmp].l = l, tree[tmp].r = r;\n    if (l==r){\n        tree[tmp].val = 0;\n        return tmp;\n    }\n    int mid = (l+r)>>1;\n    tree[tmp].left = build(l, mid);\n    tree[tmp].right = build(mid+1, r);\n    tree[tmp].val = 0;\n    return tmp;\n}\ninline int add(int src, int target_idx){    \/\/\u5728src\u7248\u672c\u7684\u7ebf\u6bb5\u6811\u4e0a\uff0c\u66f4\u6539target_idx\u5904\u7684\u503c\u4e3aval\uff0c\u8fd4\u56de\u65b0\u6811\u6839\n    int tmp = ++top;\n    tree[tmp].l = tree[src].l, tree[tmp].r = tree[src].r;\n    if (tree[src].l == tree[src].r){\n        tree[tmp].val = tree[src].val + 1;\n        return tmp;\n    }\n    ;\n    if (target_idx <= tree[tree[src].left].r){\n        tree[tmp].left = add(tree[src].left, target_idx);\n        tree[tmp].right = tree[src].right;\n    }else{\n        tree[tmp].right = add(tree[src].right, target_idx);\n        tree[tmp].left = tree[src].left;\n    }\n    tree[tmp].val = tree[tree[tmp].left].val + tree[tree[tmp].right].val;\n    return tmp;\n}\ninline int search(int rt1, int rt2, int k){\n    if (tree[rt2].l == tree[rt2].r){\n        return tree[rt2].l;\n    }\n    int l = tree[tree[rt2].left].val-tree[tree[rt1].left].val, r = tree[tree[rt2].right].val-tree[tree[rt1].right].val;\n    if (l >= k)  return search(tree[rt1].left, tree[rt2].left, k);\n    return search(tree[rt1].right, tree[rt2].right, k-l);\n}\n\ninline bool cmp1(struct num a, struct num b){\n    if (a.val != b.val) return a.val < b.val;\n    return a.idx < b.idx;\n}\ninline bool cmp2(struct num a, struct num b){\n    return a.idx < b.idx;\n}\ninline int read(){\n    int x=0, f=1;\n    char ch = getchar();\n    while (ch<'0' || ch>'9'){\n        if (ch=='-')    f = -1;\n        ch = getchar();\n    }\n    while (ch>='0' && ch<='9'){\n        x = x*10 + ch-'0';\n        ch = getchar();\n    }\n    return x*f;\n}\nint main(){\n    int t, l, r, k;\n    t = 1;\n    while (t--){\n        top = 0;\n        n = read(), m = read();\n        for (int i=1; i<=n; i++){\n            nums[i].val = read();\n            nums[i].idx = i;\n        }\n        sort(nums+1, nums+n+1, cmp1);\n        for (int i=1; i<=n; i++){\n            nums[i].ser = i;\n            ser[i] = nums[i].val;\n        }\n        sort(nums+1, nums+n+1, cmp2);\n        root[0] = build(1, n);\n        for (int i=1; i<=n; i++){\n            root[i] = add(root[i-1], nums[i].ser);\n        }\n        for (int i=1; i<=m; i++){\n            l=read(), r=read(), k=read();    \/\/scanf ("%d %d %d", &l, &r, &k);\n            printf ("%d\\n", ser[search(root[l-1], root[r], k)]);\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n
Kth number<\/a><\/h4>\n
\u73b0\u5728\u6b63\u5f0f\u8bf4\u4e00\u4e0b\u8fd9\u9898\u662f\u5982\u4f55\u7528\u5230\u4e3b\u5e2d\u6811\u7684\u3002
\n\u6211\u4eec\u5148\u628a\u539f\u6570\u7ec4\u79bb\u6563\u5316\uff0c\u56e0\u4e3a\u6211\u4eec\u53ea\u9700\u8981\u7528\u5230\u539f\u6765\u6570\u7ec4\u4e2d\u5143\u7d20\u4e4b\u95f4\u7684\u5927\u5c0f\u5173\u7cfb\uff0c\u548c\u6570\u503c\u5176\u5b9e\u6ca1\u592a\u5927\u5173\u7cfb\uff0c\u90a3\u6211\u4eec\u53ef\u4ee5\u5148\u628a\u5b83\u6392\u4e2a\u5e8f\uff0c\u4ece\u5c0f\u5230\u5927\uff0c\u7136\u540e\u7f16\u4e2a\u53f71,,n\uff0c\u7528\u7f16\u53f7\u6765\u8868\u793a\u6bcf\u4e2a\u6570\uff0c\u8fd9\u6837\u5c31\u628a\u6570\u503c\u6bd4\u8f83\u79bb\u6563\u7684\u6570\u7ec4\u53d8\u6210\u6570\u503c\u90fd\u5728n\u5185\u7684\u6570\u4e86\uff0c\u7f16\u53f7\u5927\u7684\u6570\u503c\u5c31\u5927\uff0c\u7f16\u53f7\u5c0f\u7684\u6570\u503c\u5c31\u5c0f\u3002
\n\u6bcf\u4e2a\u7248\u672c\u7684\u7ebf\u6bb5\u6811\u4e2d\uff0c\u5bf9\u4e8e\u8868\u793a\u533a\u95f4[l, r]\u7684\u7ed3\u70b9\uff0c\u5176\u6743\u503c\u4e3a\u5927\u5c0f\u7f16\u53f7\u5728[l,r]\u5185\u7684\u6570\u7684\u4e2a\u6570\u3002\u800c\u4e0d\u662f\u539f\u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e\u533a\u95f4[l,r]\u3002\u90a3\u4e48\u4e24\u4e2a\u7ebf\u6bb5\u6811\u5185\u7684\u6743\u503c\u76f8\u51cf\uff0c\u5c31\u662f\u8fd9\u4e24\u4e2a\u7ebf\u6bb5\u6811\u5bf9\u5e94\u4f4d\u7f6e\u533a\u95f4\u5185\u7684\u6240\u6709\u6570\u6784\u6210\u7684\u7ebf\u6bb5\u6811\u4e86\u3002\u6211\u4eec\u8981\u627e\u4ece\u5c0f\u5230\u5927\u67e5\u8be2\u7b2ck\u5c0f\u6570\u5373\u53ef\u3002<\/p>\n
\u56de\u5230\u539f\u6765\u7684\u5e8f\u5217\uff0c\u628a\u6570\u7ec4\u5185\u7684\u6570\u4e00\u6b21\u63d2\u5165\u4e3b\u5e2d\u6811\u4e2d\uff0c\u7b2ci\u4e2a\u6570\u6240\u5728\u7684\u5c31\u662f\u7b2ci\u4e2a\u7248\u672c\u7684\u7ebf\u6bb5\u6811\uff0c\u63d2\u5165\u7684\u6743\u503c\u662f\uff1a\u8fd9\u4e2a\u5143\u7d20\u7684\u7f16\u53f7\u6240\u5728\u4f4d\u7f6e+1\u3002
\n\u6ce8\u610f\u7ed3\u6784\u4f53\u5185\u53bb\u6389\u533a\u95f4\u4fe1\u606f\uff0c\u53ea\u4fdd\u5b58\u5de6\u53f3\u5b69\u5b50\u548c\u6743\u503c<\/strong><\/p>\n
\n
build(): \u5efa\u7acb\u521d\u59cb\u7ebf\u6bb5\u6811\uff0c\u8fd4\u56de\u6811\u6839\u4e0b\u6807
\nadd(): \u65b0\u52a0\u4e00\u4e2a\u7248\u672c\uff0c\u5728\u539f\u6765\u67d0\u4e2a\u7248\u672c\u7684\u57fa\u7840\u4e0a\u4fee\u6539\uff0c\u8fd4\u56de\u6811\u6839\u4e0b\u6807
\nsearch(): \u5728\u67d0\u4e2a\u7248\u672c\u4e0a\u67e5\u627e
\n\u4e09\u4e2a\u51fd\u6570\u90fd\u628a\u533a\u95f4\u4fe1\u606f[l, r]\u4f5c\u4e3a\u53c2\u6570\u4f20\u9012\u3002<\/p>\n<\/blockquote>\n
#include <cstdio>\n#include <algorithm>\nusing namespace std;\nconst int maxn = 1e5+5;\nstruct num{\n    int val, idx;\n    int ser;\n}nums[maxn];\nint n, m;\nint ser[maxn];\n\nstruct tree{\n    int left, right, val;                        \/\/val\u4e3a\u533a\u95f4\u5185\u503c\u7684\u4e2a\u6570\n    \/\/int l, r;\n}tree[maxn*30];                       \/\/\u6570\u636e\u6c60\nint top;                              \/\/\u6570\u636e\u6c60\u7684\u4f7f\u7528\u4fe1\u606f\nint root[maxn];                       \/\/\u5b58\u50a8\u5404\u4e2a\u7248\u672c\u7684\u6839\u7684\u4f4d\u7f6e(\u6570\u636e\u6c60\u4e2d\u7684\u4e0b\u6807)\n\ninline int build(int l, int r){              \/\/\u5efa\u7acb\u521d\u59cb\u7a7a\u6811\n    int tmp = ++top;\n    \/\/tree[tmp].l = l, tree[tmp].r = r;\n    if (l==r){\n        tree[tmp].val = 0;\n        return tmp;\n    }\n    int mid = (l+r)>>1;\n    tree[tmp].left = build(l, mid);\n    tree[tmp].right = build(mid+1, r);\n    tree[tmp].val = 0;\n    return tmp;\n}\ninline int add(int src, int l, int r, int target_idx){    \/\/\u5728src\u7248\u672c\u7684\u7ebf\u6bb5\u6811\u4e0a\uff0c\u66f4\u6539target_idx\u5904\u7684\u503c, \u8fd4\u56de\u65b0\u6811\u6839\n    int tmp = ++top;\n    if (l==r){\n        tree[tmp].val = tree[src].val + 1;\n        return tmp;\n    }\n    int mid = (l+r)>>1;\n    if (target_idx <= mid){\n        tree[tmp].left = add(tree[src].left, l, mid, target_idx);\n        tree[tmp].right = tree[src].right;\n    }else{\n        tree[tmp].right = add(tree[src].right, mid+1, r, target_idx);\n        tree[tmp].left = tree[src].left;\n    }\n    tree[tmp].val = tree[tree[tmp].left].val + tree[tree[tmp].right].val;\n    return tmp;\n}\ninline int search(int rt1, int rt2, int l, int r, int k){\n    if (l==r){\n        return l;\n    }\n    int x = tree[tree[rt2].left].val-tree[tree[rt1].left].val;\n    int y = tree[tree[rt2].right].val-tree[tree[rt1].right].val;\n    int mid = (l+r)>>1;\n    if (x >= k)  return search(tree[rt1].left, tree[rt2].left, l, mid, k);\n    return search(tree[rt1].right, tree[rt2].right, mid+1, r, k-x);\n}\n\ninline bool cmp1(struct num a, struct num b){\n    if (a.val != b.val) return a.val < b.val;\n    return a.idx < b.idx;\n}\ninline bool cmp2(struct num a, struct num b){\n    return a.idx < b.idx;\n}\ninline int read(){\n    int x=0, f=1;\n    char ch = getchar();\n    while (ch<'0' || ch>'9'){\n        if (ch=='-')    f = -1;\n        ch = getchar();\n    }\n    while (ch>='0' && ch<='9'){\n        x = x*10 + ch-'0';\n        ch = getchar();\n    }\n    return x*f;\n}\nint main(){\n    int t, l, r, k;\n    t = read();\n    while (t--){\n        top = 0;\n        n = read(), m = read();\n        for (int i=1; i<=n; i++){\n            nums[i].val = read(); \n            nums[i].idx = i;\n        }\n        sort(nums+1, nums+n+1, cmp1);\n        for (int i=1; i<=n; i++){\n            nums[i].ser = i;\n            ser[i] = nums[i].val;\n        }\n        sort(nums+1, nums+n+1, cmp2);\n        root[0] = build(1, n);\n        for (int i=1; i<=n; i++){\n            root[i] = add(root[i-1], 1, n, nums[i].ser);\n        }\n        for (int i=1; i<=m; i++){\n            l=read(), r=read(), k=read();\n            printf ("%d\\n", ser[search(root[l-1], root[r], 1, n, k)]);\n        }\n    }\n    return 0;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<\/code><\/pre>\n
\u6700\u540e\u5728\u8bf4\u4e00\u4e0b\u6210\u529f\u63d0\u4ea4hdu\u7684\u6280\u5de7\uff0c\u81f3\u4e8e\u4e3a\u4ec0\u4e48\u6211\u603b\u662f\u80fd\u5199\u51fa\u4e0d\u80fd\u6210\u529f\u63d0\u4ea4\u7684\u4ee3\u7801\uff0c\u8bf4\u771f\u7684\uff0c\u9b3c\u77e5\u9053\u3002\u3002\u3002
\n\u6211\u53d1\u73b0\u6bcf\u6b21\u6211\u4e00\u63d0\u4ea4\uff0c\u4f1a\u663e\u793a\u7f51\u7edc\u65e0\u6cd5\u8fde\u63a5\uff0c\u7136\u540e\u63d0\u4ea4\u7684\u4ee3\u7801\u4f1a\u7f3a\u5931\u540e\u9762\u4e00\u90e8\u5206\uff0c\u6309\u67d0\u4e2a\u767e\u5206\u6bd4\u7f3a\u5931\u3002\u3002\u3002\u8981\u547d\u7684\u662f\u8fd8\u662f\u4e00\u4e0b\u63d0\u4ea4\u597d\u51e0\u53d1wc\uff0c\uff0c\u7136\u540e\u6211\u5c31\u60f3\u5230\u5728\u4ee3\u7801\u540e\u9762\u52a0\u4e0a\u4e00\u884c\u65e0\u7a77\u591a\u7684\u659c\u7ebf\/\/\/\/\/\/\/\/\/\/\uff0c\u8fd9\u6837\u524d\u9762\u7684\u6709\u6548\u7684\u4ee3\u7801\u4f1a\u5168\u90e8\u6210\u529f\u63d0\u4ea4\uff0c\u540e\u9762\u7684\u659c\u7ebf\u53ef\u80fd\u4f1a\u7f3a\u5931\u4e00\u90e8\u5206\uff0c\u8fd9\u6837\u4e5f\u662f\u6210\u529f\u63d0\u4ea4\u4e86\u7684\uff0c\uff0c\uff0c\u53cd\u6b63AC\u4e86\u3002
\n\u5982\u679c\u8fd8\u662f\u63d0\u4ea4\u5931\u8d25\uff0c\u90a3\u662f\u4f60\u540e\u9762\u7684\u659c\u7ebf\u4e0d\u591f\u591a\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u521d\u6b21\u63a5\u89e6\u4e3b\u5e2d\u6811\uff0c\u8fd8\u6ca1\u6709\u627e\u5230\u5f88\u597d\u7684\u677f\u5b50\uff0c\u5c31\u81ea\u5df1\u5148\u778e\u5199\u4e86\u4e00\u6bb5\uff0c\u5e38\u6570\u6709\u70b9\u5927\u3002\u90a3\u5c31\u5148\u8bf4\u4e24\u53e5\u4e3b\u5e2d\u6811\u7684\u601d\u60f3\u3002 \u4e3b […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[52],"tags":[],"_links":{"self":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/710"}],"collection":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/comments?post=710"}],"version-history":[{"count":15,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/710\/revisions"}],"predecessor-version":[{"id":725,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/710\/revisions\/725"}],"wp:attachment":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/media?parent=710"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/categories?post=710"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/tags?post=710"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}