{"id":200,"date":"2025-11-03T18:06:44","date_gmt":"2025-11-03T10:06:44","guid":{"rendered":"https:\/\/caoxunyi.cn\/?p=200"},"modified":"2025-11-16T22:15:10","modified_gmt":"2025-11-16T14:15:10","slug":"c-stl-%e6%a0%87%e5%87%86%e6%a8%a1%e6%9d%bf%e5%ba%93","status":"publish","type":"post","link":"https:\/\/caoxunyi.cn\/index.php\/200\/","title":{"rendered":"C++ STL (\u6807\u51c6\u6a21\u677f\u5e93)"},"content":{"rendered":"<blockquote>\n<p>STL (Standard Template Library)\uff1a\u662f C++ \u6807\u51c6\u5e93\u7684\u91cd\u8981\u7ec4\u6210\u90e8\u5206\uff0c\u4e0d\u4ec5\u662f\u4e00\u4e2a\u53ef\u590d\u7528\u7684\u7ec4\u4ef6\u5e93\uff0c\u800c\u4e14\u662f\u4e00\u4e2a\u5305\u7f57\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684\u8f6f\u4ef6\u6846\u67b6\u3002<\/p>\n<p><strong>\u901a\u4fd7\u6765\u8bf4\uff1a<\/strong>STL \u5c31\u662f\u5c06\u5e38\u89c1\u7684\u6570\u636e\u7ed3\u6784\uff08\u4f8b\u5982 \u987a\u5e8f\u8868\uff0c\u94fe\u8868\uff0c\u6808\uff0c\u961f\u5217\uff0c\u4e8c\u53c9\u6811\uff0c\u54c8\u5e0c...\uff09\u4ee5\u6a21\u677f\u7684\u5f62\u5f0f\u8fdb\u884c\u5c01\u88c5\uff0c\u4f7f\u7528\u65f6\uff0c\u4e0d\u7528\u6211\u4eec\u4eba\u4e3a\u518d\u53bb\u5199\uff0c\u53ef\u4ee5\u76f4\u63a5\u8c03\u7528\u3002\u5e76\u4e14\u5305\u542b\u5e38\u89c1\u7684\u901a\u7528\u7684\u6cdb\u578b\u7b97\u6cd5\uff08\u4e00\u4e9b\u5e38\u89c4\u7684\u7b97\u6cd5\u4e5f\u4e0d\u7528\u81ea\u5df1\u5b9e\u73b0\uff0c\u53ef\u4ee5\u76f4\u63a5\u8c03\u7528\uff09\u3002<\/p>\n<\/blockquote>\n<h3>STL \u516d\u5927\u7ec4\u4ef6<\/h3>\n<ul>\n<li>\n<p><strong>\u5bb9\u5668\uff08Container\uff09\uff1a<\/strong> \u5404\u79cd\u6570\u636e\u7ed3\u6784\uff0c\u5982 <code>vector<\/code>\u3001<code>list<\/code>\u3001<code>deque<\/code>\u3001<code>set<\/code>\u3001<code>map<\/code> \u7b49\uff0c\u4ee5\u6a21\u677f\u7c7b\u7684\u65b9\u6cd5\u63d0\u4f9b\u3002\u4e3a\u4e86\u8bbf\u95ee\u5bb9\u5668\u4e2d\u7684\u6570\u636e\uff0c\u53ef\u4ee5\u4f7f\u7528\u7531\u5bb9\u5668\u7c7b\u8f93\u51fa\u7684\u8fed\u4ee3\u5668\u3002<\/p>\n<\/li>\n<li>\n<p><strong>\u7b97\u6cd5\uff08Algorithm\uff09\uff1a<\/strong> \u5404\u79cd\u5e38\u7528\u7b97\u6cd5\uff0c\u63d0\u4f9b\u4e86\u6267\u884c\u5404\u79cd\u64cd\u4f5c\u7684\u65b9\u5f0f\uff0c\u5305\u62ec\u5bf9\u5bb9\u5668\u5185\u5bb9\u6267\u884c\u521d\u59cb\u5316\u3001\u6392\u5e8f\u3001\u641c\u7d22\u548c\u8f6c\u6362\u7b49\u64cd\u4f5c\uff0c\u5982 <code>sort<\/code>\u3001<code>find<\/code>\u3001<code>copy<\/code>\u3001<code>erase<\/code> \u51fd\u6570\u7b49\u3002\u51fd\u6570\u672c\u8eab\u4e0e\u5b83\u4eec\u64cd\u4f5c\u7684\u6570\u636e\u7684\u7ed3\u6784\u548c\u7c7b\u578b\u65e0\u5173\uff0c\u56e0\u6b64\u5b83\u4eec\u53ef\u4ee5\u5728\u4ece\u7b80\u5355\u6570\u7ec4\u5230\u9ad8\u5ea6\u590d\u6742\u5bb9\u5668\u7684\u4efb\u4f55\u6570\u636e\u7ed3\u6784\u4e0a\u4f7f\u7528\u3002<\/p>\n<\/li>\n<li>\n<p><strong>\u8fed\u4ee3\u5668\uff08Iterator\uff09\uff1a<\/strong> \u8fed\u4ee3\u5668\u63d0\u4f9b\u4e86\u8bbf\u95ee\u5bb9\u5668\u4e2d\u5bf9\u8c61\u7684\u65b9\u6cd5\uff0c\u626e\u6f14\u5bb9\u5668\u4e0e\u7b97\u6cd5\u4e4b\u95f4\u7684\u80f6\u5408\u5242\uff0c\u662f\u6240\u8c13\u7684\u201c\u6cdb\u578b\u6307\u9488\u201d\uff0c\u5171\u6709 5 \u79cd\u7c7b\u578b\uff0c\u4ee5\u53ca\u5176\u4ed6\u884d\u751f\u53d8\u5316\uff0c\u662f\u4e00\u79cd\u5c06 <code>operator*<\/code>\u3001<code>operator-&gt;<\/code>\u3001<code>operator++<\/code>\u3001<code>operator--<\/code> \u7b49\u6307\u9488\u64cd\u4f5c\u4e88\u4ee5\u91cd\u8f7d\u7684\u6a21\u677f\u7c7b\u3002\u6240\u6709\u7684 STL \u5bb9\u5668\u9644\u5e26\u6709\u81ea\u5df1\u4e13\u5c5e\u7684\u8fed\u4ee3\u5668\uff0c\u56e0\u4e3a\u53ea\u6709\u5bb9\u5668\u8bbe\u8ba1\u8005\u624d\u77e5\u9053\u5982\u4f55\u904d\u5386\u81ea\u5df1\u7684\u5143\u7d20\u3002<\/p>\n<blockquote>\n<p>c++11\u7248\u672c\u53ca\u4ee5\u540e\u5c31\u53ef\u4ee5\u4e0d\u7528\u8fed\u4ee3\u5668\u4e86\u3002<\/p>\n<\/blockquote>\n<\/li>\n<li>\n<p><strong>\u4eff\u51fd\u6570\uff08Functor\uff09\uff1a<\/strong> \u4e5f\u79f0\u4e3a\u51fd\u6570\u5bf9\u8c61\uff08Function object\uff09\uff0c\u884c\u4e3a\u7c7b\u4f3c\u51fd\u6570\uff0c\u53ef\u4f5c\u4e3a\u7b97\u6cd5\u7684\u67d0\u79cd\u7b56\u7565\u3002\u4ece\u5b9e\u73b0\u89d2\u5ea6\u6765\u770b\uff0c\u4eff\u51fd\u6570\u662f\u4e00\u79cd\u91cd\u8f7d\u4e86 <code>operator()<\/code> \u7684\u7c7b\u6216\u8005\u6a21\u677f\u7c7b\u3002<\/p>\n<\/li>\n<li>\n<p><strong>\u9002\u914d\u5668\uff08Adaptor\uff09\uff1a<\/strong> \u4e00\u79cd\u7528\u6765\u4fee\u9970\u5bb9\u5668\u3001\u4eff\u51fd\u6570\u6216\u8005\u8fed\u4ee3\u5668\u63a5\u53e3\u7684\u673a\u5236\u3002\u4f8b\u5982 STL \u63d0\u4f9b\u7684 <code>queue<\/code> \u548c <code>stack<\/code>\uff0c\u5c31\u662f\u4e00\u79cd\u7a7a\u95f4\u914d\u63a5\u5668\uff0c\u56e0\u4e3a\u5b83\u4eec\u7684\u5e95\u90e8\u5b8c\u5168\u501f\u52a9\u4e8e <code>deque<\/code>\u3002<\/p>\n<\/li>\n<li>\n<p><strong>\u5206\u914d\u5668\uff08allocator\uff09\uff1a<\/strong> \u4e5f\u79f0\u4e3a\u7a7a\u95f4\u914d\u7f6e\u5668\uff0c\u8d1f\u8d23\u7a7a\u95f4\u7684\u914d\u7f6e\u4e0e\u7ba1\u7406\u3002\u4ece\u5b9e\u73b0\u7684\u89d2\u5ea6\u6765\u770b\uff0c\u914d\u7f6e\u5668\u662f\u4e00\u4e2a\u5b9e\u73b0\u4e86\u52a8\u6001\u914d\u7f6e\u7a7a\u95f4\u3001\u7a7a\u95f4\u7ba1\u7406\u3001\u7a7a\u95f4\u91ca\u653e\u7684\u6a21\u677f\u7c7b\u3002<\/p>\n<\/li>\n<\/ul>\n<h2>\u7b97\u6cd5 (Algorithm)<\/h2>\n<p>\u5934\u6587\u4ef6\uff1a`#include <\/p>\n<algorithm>`\n\n### \u5e38\u7528\u51fd\u6570\n\n- **`sort()`**\n\n  - **\u529f\u80fd\uff1a** `sort()` \u51fd\u6570\u53ef\u4ee5\u5bf9\u7ed9\u5b9a\u533a\u95f4\u6240\u6709\u5143\u7d20\u8fdb\u884c\u6392\u5e8f\u3002\n  - **\u53c2\u6570\uff1a** `sort(begin, end, cmp)`\n    - `begin`\uff1a\u6307\u5411\u5f85 `sort()` \u7684\u6570\u7ec4\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u6307\u9488\u3002\n    - `end`\uff1a\u6307\u5411\u5f85 `sort()` \u7684\u6570\u7ec4\u7684\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u4e0b\u4e00\u4e2a\u4f4d\u7f6e\u7684\u6307\u9488\u3002\n    - `cmp`\uff1a\u6392\u5e8f\u51c6\u5219\uff0c\u53ef\u4ee5\u4e0d\u5199\uff0c\u9ed8\u8ba4\u4ece\u5c0f\u5230\u5927\u8fdb\u884c\u6392\u5e8f\u3002\n\n  ```c++\n  #include\n<iostream>\n  #include\n<algorithm>\n  using namespace std;\n\n  int main(){\n      int num[10] = {6,5,9,1,2,8,7,3,4,0};\n      \/\/ greater\n<int>() \u662f\u4e00\u4e2a\u4eff\u51fd\u6570\uff0c\u8868\u793a\u964d\u5e8f\u6392\u5217\uff0c\u8fd9\u91cc\u53ea\u505a\u6f14\u793a\uff0c\u662f\u4e00\u4e2a\u4f2a\u4ee3\u7801\n      sort(num, num+10, greater\n<int>());\n      \/\/ \u6392\u5e8f\u540e num \u53d8\u4e3a\uff1a9 8 7 6 5 4 3 2 1 0\n      return 0;\n  }\n  ```\n\n- **`swap()`**\u4ea4\u6362\u4e24\u4e2a\u6570\u7684\u503c\n\n  ```c++\n  int a = 1, b = 2 ;\n  cout << a << ' ' << b << '\\n' ;\n  swap(a, b) ;\n  ```\n\n- **`min()`**\u53d6\u6700\u5c0f\u503c\n\n- **`max()`**\u53d6\u6700\u5927\u503c\n\n### \ud83d\udca1 \u6392\u5e8f\u7ec3\u4e60\n\n[P5740 \u3010\u6df1\u57fa7.\u4f8b9\u3011\u6700\u5389\u5bb3\u7684\u5b66\u751f - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/P5740)\n\n# P5740 \u3010\u6df1\u57fa7.\u4f8b9\u3011\u6700\u5389\u5bb3\u7684\u5b66\u751f\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u73b0\u6709 $N$ \u540d\u540c\u5b66\u53c2\u52a0\u4e86\u671f\u672b\u8003\u8bd5\uff0c\u5e76\u4e14\u83b7\u5f97\u4e86\u6bcf\u540d\u540c\u5b66\u7684\u4fe1\u606f\uff1a\u59d3\u540d\uff08\u4e0d\u8d85\u8fc7 $8$ \u4e2a\u5b57\u7b26\u7684\u4ec5\u6709\u82f1\u6587\u5c0f\u5199\u5b57\u6bcd\u7684\u5b57\u7b26\u4e32\uff09\u3001\u8bed\u6587\u3001\u6570\u5b66\u3001\u82f1\u8bed\u6210\u7ee9\uff08\u5747\u4e3a\u4e0d\u8d85\u8fc7 $150$ \u7684\u81ea\u7136\u6570\uff09\u3002\u603b\u5206\u6700\u9ad8\u7684\u5b66\u751f\u5c31\u662f\u6700\u5389\u5bb3\u7684\uff0c\u8bf7\u8f93\u51fa\u6700\u5389\u5bb3\u7684\u5b66\u751f\u5404\u9879\u4fe1\u606f\uff08\u59d3\u540d\u3001\u5404\u79d1\u6210\u7ee9\uff09\u3002\u5982\u679c\u6709\u591a\u4e2a\u603b\u5206\u76f8\u540c\u7684\u5b66\u751f\uff0c\u8f93\u51fa\u9760\u524d\u7684\u90a3\u4f4d\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n\u7b2c\u4e00\u884c\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570 $N$\uff0c\u8868\u793a\u5b66\u751f\u4e2a\u6570\u3002\n\n\u7b2c\u4e8c\u884c\u5f00\u59cb\uff0c\u5f80\u4e0b $N$ \u884c\uff0c\u5bf9\u4e8e\u6bcf\u4e00\u884c\u9996\u5148\u5148\u8f93\u5165\u4e00\u4e2a\u5b57\u7b26\u4e32\u8868\u793a\u5b66\u751f\u59d3\u540d\uff0c\u518d\u8f93\u5165\u4e09\u4e2a\u81ea\u7136\u6570\u8868\u793a\u8bed\u6587\u3001\u6570\u5b66\u3001\u82f1\u8bed\u7684\u6210\u7ee9\u3002\u5747\u7528\u7a7a\u683c\u76f8\u9694\u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n\u8f93\u51fa\u6700\u5389\u5bb3\u7684\u5b66\u751f\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\n3\nsenpai 114 51 4\nlxl 114 10 23\nfafa 51 42 60\n```\n\n### \u8f93\u51fa #1\n\n```\nsenpai 114 51 4\n```\n\n## \u8bf4\u660e\/\u63d0\u793a\n\n\u6570\u636e\u4fdd\u8bc1\uff0c$1 \\leq N \\leq 1000$\uff0c\u59d3\u540d\u4e3a\u957f\u5ea6\u4e0d\u8d85\u8fc7 $8$ \u7684\u5b57\u7b26\u4e32\uff0c\u8bed\u6587\u3001\u6570\u5b66\u3001\u82f1\u8bed\u6210\u7ee9\u5747\u4e3a\u4e0d\u8d85\u8fc7 $150$ \u7684\u81ea\u7136\u6570\u3002\n\n---\n\n**\u81ea\u5b9a\u4e49 `cmp` \u51fd\u6570\u5b9e\u73b0\u7ed3\u6784\u4f53\u6392\u5e8f**\n\n```c++\n#include <bits>\nusing namespace std ;\nconst int N = 1008 ;\n\nstruct node {\n    string name ;\n    int a, b, c ;\n    int sum ;\n    int num ;\n} no[N];\n\n\/\/ \u81ea\u5b9a\u4e49\u6bd4\u8f83\u51fd\u6570\nbool cmp(node x, node y) {\n    \/\/ \u5982\u679c\u603b\u5206\u76f8\u540c\n    if (x.sum == y.sum) {\n        \/\/ \u6309\u5b66\u53f7\u4ece\u5c0f\u5230\u5927\n        return x.num < y.num ;\n    }\n    \/\/ \u5426\u5219\u6309\u603b\u5206\u4ece\u5927\u5230\u5c0f\n    return x.sum > y.sum ;\n}\n\nint main() {\n    int n ;\n    cin >> n ;\n    for (int i = 1 ; i <= n ; i ++) {\n        cin >> no[i].name >> no[i].a >> no[i].b >> no[i].c ;\n        no[i].sum = no[i].a + no[i].b + no[i].c ;\n        no[i].num = i ;\n    }\n\n    \/\/ \u4f7f\u7528\u81ea\u5b9a\u4e49\u7684 cmp \u51fd\u6570\u8fdb\u884c\u6392\u5e8f\n    sort(no + 1, no + n + 1, cmp) ;\n\n    cout << no[1].name << ' ' << no[1].a << ' ' << no[1].b << ' ' << no[1].c <<'\\n' ;\n    return 0 ;\n}\n```\n\n------\n\n## \ud83d\udce6 \u5bb9\u5668 (Container)\n\n\u5bb9\u5668\u662f\u5b58\u653e\u6570\u636e\u7684\u6570\u636e\u7ed3\u6784\uff0c\u6bd4\u5982\u94fe\u8868\uff0c\u6570\u7ec4\uff0c\u961f\u5217... \u5bb9\u5668\u90fd\u662f\u4e00\u4e2a\u7c7b\uff08\u7528\u6cd5\u4e0e\u7ed3\u6784\u4f53\u76f8\u4f3c\uff09\u3002\u8bbf\u95ee\u7c7b\u5bf9\u8c61\u5185\u7684\u51fd\u6570\u6216\u53d8\u91cf\u7528\u70b9\u8fd0\u7b97\u7b26 `.`\u3002\n\n### `vector` (\u53ef\u53d8\u957f\u5ea6\u6570\u7ec4)\n\nvector\u7ffb\u8bd1\u4e3a\u5411\u91cf\uff0c\u4f46\u662f\u8fd9\u91cc\u4f7f\u7528\u201c\u53d8\u957f\u6570\u7ec4\u201d\u7684\u53eb\u6cd5\u66f4\u5bb9\u6613\u7406\u89e3\uff0c\u4e5f\u5373\u201c\u957f\u5ea6\u6839\u636e\u9700\u8981\u800c\u81ea\u52a8\u6539\u53d8\u7684\u6570\u7ec4\u201d\u3002\u6211\u4eec\u77e5\u9053\u5728C\u8bed\u8a00\u4e2d\uff0c\u666e\u901a\u6570\u7ec4\u5927\u5c0f\u4e00\u65e6\u786e\u5b9a\u5c31\u4e0d\u80fd\u6539\u53d8\u4e86\uff0c\u5728\u505a\u9898\u65f6\u6709\u65f6\u4f1a\u78b0\u5230\u53ea\u7528\u666e\u901a\u6570\u7ec4\u4f1a\u8d85\u5185\u5b58\u7684\u60c5\u51b5\uff0c\u8fd9\u65f6\u6211\u4eec\u5c31\u53ef\u4ee5\u4f7f\u7528vector\u6765\u5b9a\u4e49\u4e0d\u5b9a\u957f\u6570\u7ec4\u8282\u7701\u7a7a\u95f4\u3002\n\n#### \u5b9a\u4e49\n\n```c++\n#include \n<vector>\nvector\n<typename> name;\n\n\/\/ \u793a\u4f8b\uff1a\nvector\n<int> v = {1, 2, 3};\n```\n\n#### \u5e38\u7528\u51fd\u6570\n\n- `push_back(x)`\uff1a\u5728 vector \u540e\u9762\u6dfb\u52a0\u4e00\u4e2a\u5143\u7d20 `x`\uff0c\u65f6\u95f4\u590d\u6742\u5ea6 O(1)\u3002\n- `pop_back()`\uff1a\u5220\u9664 vector \u6700\u540e\u4e00\u4e2a\u5143\u7d20\uff0c\u65f6\u95f4\u590d\u6742\u5ea6 O(1)\u3002\n- `back()`\uff1a\u8fd4\u56de\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u503c\u3002\n- `front()`\uff1a\u8fd4\u56de\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u503c\u3002\n- `size()`\uff1a\u8fd4\u56de vector \u4e2d\u5143\u7d20\u7684\u4e2a\u6570\uff0c\u65f6\u95f4\u590d\u6742\u5ea6 O(1)\u3002\n- `clear()`\uff1a\u6e05\u7a7a vector \u4e2d\u7684\u6240\u6709\u5143\u7d20\uff0c\u65f6\u95f4\u590d\u6742\u5ea6 O(N)\u3002\n- `insert(it, x)`\uff1a\u5411\u8fed\u4ee3\u5668 `it` \u5904\u63d2\u5165\u4e00\u4e2a\u5143\u7d20 `x`\uff0c\u65f6\u95f4\u590d\u6742\u5ea6 O(N)\u3002\n- `erase(it)`\uff1a\u5220\u9664\u8fed\u4ee3\u5668 `it` \u5904\u7684\u5143\u7d20\u3002\n- `erase(first, last)`\uff1a\u5220\u9664 `[first, last)` \u533a\u95f4\u5185\u7684\u6240\u6709\u5143\u7d20\u3002\n\n#### \u8fed\u4ee3\u5668\n\n```c++\nvector\n<int> v = {1, 2, 3};\nvector\n<int>::iterator it ;\n\n\/\/ \u4f20\u7edf\u8fed\u4ee3\u5668\u904d\u5386\nfor (it = v.begin() ; it != v.end() ; it ++) {\n    cout << *it << '\\n' ;\n}\n\n\/\/ C++11 \n\/\/ \n\/\/ \n\/\/ \nfor (auto i : v) { \/\/ auto \u81ea\u52a8\u63a8\u5bfc\u7c7b\u578b\n    cout << i << ' ' ;\n}\n```\n\n#### \u7ec3\u4e60\n\n[P1567 \u7edf\u8ba1\u5929\u6570 - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/P1567)\n\n# P1567 \u7edf\u8ba1\u5929\u6570\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u708e\u70ed\u7684\u590f\u65e5\uff0cKC \u975e\u5e38\u7684\u4e0d\u723d\u3002\u4ed6\u5b81\u53ef\u5fcd\u53d7\u5317\u6781\u7684\u5bd2\u51b7\uff0c\u4e5f\u4e0d\u613f\u5fcd\u53d7\u53a6\u95e8\u7684\u590f\u5929\u3002\u6700\u8fd1\uff0c\u4ed6\u5f00\u59cb\u7814\u7a76\u5929\u6c14\u7684\u53d8\u5316\u3002\u4ed6\u5e0c\u671b\u7528\u7814\u7a76\u7684\u7ed3\u679c\u9884\u6d4b\u672a\u6765\u7684\u5929\u6c14\u3002\n\n\u7ecf\u5386\u5343\u8f9b\u4e07\u82e6\uff0c\u4ed6\u6536\u96c6\u4e86\u8fde\u7eed $N(1 \\leq N \\leq 10^6)$ \u5929\u7684\u6700\u9ad8\u6c14\u6e29\u6570\u636e\u3002\n\n\u73b0\u5728\uff0c\u4ed6\u60f3\u77e5\u9053\u6700\u9ad8\u6c14\u6e29\u4e00\u76f4\u4e0a\u5347\u7684\u6700\u957f\u8fde\u7eed\u5929\u6570\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n\u7b2c 1 \u884c\uff1a\u4e00\u4e2a\u6574\u6570 $N$ \u3002$1 \\leq N \\leq 10^6$\n\n\u7b2c 2 \u884c\uff1a$N$\u4e2a\u7a7a\u683c\u9694\u5f00\u7684\u6574\u6570\uff0c\u8868\u793a\u8fde\u7eed $N$ \u5929\u7684\u6700\u9ad8\u6c14\u6e29\u3002$0 \\leq$ \u6700\u9ad8\u6c14\u6e29 $\\leq 10^9$ \u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n1 \u884c\uff1a\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u6700\u9ad8\u6c14\u6e29\u4e00\u76f4\u4e0a\u5347\u7684\u6700\u957f\u8fde\u7eed\u5929\u6570\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\n10\n1 2 3 2 4 5 6 8 5 9\n```\n\n### \u8f93\u51fa #1\n\n```\n5\n```\n\n---\n\n```c++\n#include <bits>\nusing namespace std ;\n\nint main() {\n    int n ;\n    cin >> n ;\n    vector\n<int> a;\n\n    for (int i = 1 ; i <= n ; i ++) {\n        int x ;\n        cin >> x ;\n        a.push_back(x) ;\n    }\n\n    int ans = 1, tmp = 1 ;\n    for (int i = 1 ; i < a.size() ; i ++) {\n        if (a[i] > a[i - 1]) {\n            tmp ++ ;\n        } else {\n            ans = max(ans, tmp) ;\n            tmp = 1 ;\n        }\n    }\n    ans = max(ans, tmp) ; \/\/ \u522b\u5fd8\u4e86\u6700\u540e\u4e00\u6b21\u7684\u6bd4\u8f83\n\n    cout << ans << '\\n' ;\n    return 0 ;\n}\n```\n\n------\n\n### `string` (\u5b57\u7b26\u4e32)\n\nC++ \u5728 STL \u4e2d\u52a0\u5165\u4e86 `string` \u7c7b\u578b\uff0c\u5bf9\u5b57\u7b26\u4e32\u5e38\u7528\u7684\u9700\u6c42\u529f\u80fd\u8fdb\u884c\u4e86\u5c01\u88c5\uff0c\u4f7f\u5f97\u64cd\u4f5c\u8d77\u6765\u66f4\u65b9\u4fbf\uff0c\u4e14\u4e0d\u6613\u51fa\u9519\u3002\n\n#### \u5934\u6587\u4ef6\n\n```c++\n#include \n<string>\n```\n\n#### \u5b9a\u4e49\n\n```c++\nstring a = \"abcd\";\n```\n\n#### \u5e38\u7528\u51fd\u6570\n\n- `+=`\uff1a\u5b57\u7b26\u4e32\u62fc\u63a5\uff0c\u5047\u8bbe\u6709\u4e24\u4e2a\u5b57\u7b26\u4e32`a`\u548c`b`\uff0c\u53ef\u7528`a+=b`\u6216`a=a+b`\u6765\u5c06`b`\u63a5\u5230`a`\u7684\u540e\u9762\u3002\n- `==`, `!=`, `<`, `<=`, `>`, `>=`\uff1a\u6309\u5b57\u5178\u5e8f\u6bd4\u8f83\u5927\u5c0f\u3002\n- `length()` \/ `size()`\uff1a\u8fd4\u56de\u5b57\u7b26\u4e32\u957f\u5ea6\uff0cO(1)\u3002\n- `erase(it)`\uff1a\u5220\u9664 `it` \u5904\u7684\u5b57\u7b26\uff0c`it` \u4e3a\u8fed\u4ee3\u5668\u3002\n- `erase(first, last)`\uff1a\u5220\u9664 `[first, last)` \u533a\u95f4\u7684\u5b57\u7b26\uff0c`first`, `last` \u4e3a\u8fed\u4ee3\u5668\u3002\n- `erase(pos, length)`\uff1a`pos` \u4e3a\u5f00\u59cb\u5220\u9664\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c`length` \u4e3a\u5220\u9664\u7684\u5b57\u7b26\u4e2a\u6570\u3002\n- `clear()`\uff1a\u6e05\u7a7a\u5b57\u7b26\u4e32 O(1)\u3002\n- `substr(pos, len)`\uff1a\u8fd4\u56de\u4ece `pos` \u53f7\u4f4d\u7f6e\u5f00\u59cb\u3001\u957f\u5ea6\u4e3a `len` \u7684\u5b50\u4e32\uff0cO(len)\u3002\n- `find(str2)`\uff1a\u5f53 `str2` \u662f `str` \u7684\u5b50\u4e32\u65f6\uff0c\u8fd4\u56de\u5176\u5728 `str` \u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\uff1b\u5426\u5219\u8fd4\u56de `string::npos`\u3002O(NM)\u3002\n- `front()`\uff1a\u8fd4\u56de\u7b2c\u4e00\u4e2a\u5b57\u7b26\u3002\n- `back()`\uff1a\u8fd4\u56de\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\u3002\n- `push_back(x)`\uff1a\u5c06\u5b57\u7b26 `x` \u52a0\u5230\u5b57\u7b26\u4e32\u540e\u3002\n- `pop_back()`\uff1a\u5220\u9664\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\u3002\n\n------\n\n### `map` (\u6620\u5c04)\n\nMap (\u6620\u5c04) \u5143\u7d20\u5305\u542b\u4e24\u90e8\u5206\uff08key, value\uff09\uff0ckey \u548c value \u53ef\u4ee5\u662f\u4efb\u610f\u7c7b\u578b\u3002\u5728 map \u91cc\u9762\uff0c\u4e00\u4e2a key \u5bf9\u5e94\u4e00\u4e2a value\uff0c\u7c7b\u4f3c\u51fd\u6570\u91cc\u4e00\u4e2a x \u5bf9\u5e94\u4e00\u4e2a y\u3002\u5e76\u4e14\u5728 map \u91cc\uff0ckey \u4e0d\u80fd\u91cd\u590d\uff0c\u81ea\u52a8\u6309 key \u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u3002\n\n#### \u5b9a\u4e49\n\n```c++\n#include \n<map>\n\nmap<int int> mp; \/\/ \u5b9a\u4e49\u4e86\u4e00\u4e2a int \u6620\u5c04 int \u7684 map\nmap<int char> mp; \/\/ int -> char\n```\n\n#### \u5e38\u89c1\u51fd\u6570\n\n- `insert(make_pair(x, y))`\uff1a\u63d2\u5165 key \u4e3a `x`\uff0cvalue \u4e3a `y` \u7684\u6620\u5c04\u3002\n\n- `insert({x,y})`\uff1aC++11 \u7248\u672c\u4e4b\u540e\uff0c\u53ef\u4ee5\u7528\u82b1\u62ec\u53f7\u6765\u751f\u6210 pair \u4e8c\u5143\u7ec4\u3002\n\n- **\u904d\u5386 map**\n\n  ```c++\n  map<int int>::iterator i;\n  for(i = mp.begin(); i != mp.end(); i++) {\n      cout << i->first << ' ' << i->second; \/\/ first \u662f key, second \u662f value\n  }\n\n  \/\/ C++11 \n  \/\/ \n  \/\/ \n  \/\/ \n  for(auto i : mp) {\n      cout << i.first << ' ' << i.second << '\\n';\n  }\n\n  \/\/ C++17 \n  \/\/ \n  \/\/ \n  \/\/ \n  for(auto [a,b] : mp) { \/\/ \u7ed3\u6784\u5316\u7ed1\u5b9a\n      cout << a << ' ' << b << '\\n';\n  }\n  ```\n\n#### \u7ec3\u4e60\n\n[P1125[NOIP2008 \u63d0\u9ad8\u7ec4] \u7b28\u5c0f\u7334 - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/P1125)\n\n# P1125 [NOIP 2008 \u63d0\u9ad8\u7ec4] \u7b28\u5c0f\u7334\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u7b28\u5c0f\u7334\u7684\u8bcd\u6c47\u91cf\u5f88\u5c0f\uff0c\u6240\u4ee5\u6bcf\u6b21\u505a\u82f1\u8bed\u9009\u62e9\u9898\u7684\u65f6\u5019\u90fd\u5f88\u5934\u75bc\u3002\u4f46\u662f\u4ed6\u627e\u5230\u4e86\u4e00\u79cd\u65b9\u6cd5\uff0c\u7ecf\u8bd5\u9a8c\u8bc1\u660e\uff0c\u7528\u8fd9\u79cd\u65b9\u6cd5\u53bb\u9009\u62e9\u9009\u9879\u7684\u65f6\u5019\u9009\u5bf9\u7684\u51e0\u7387\u975e\u5e38\u5927\uff01\n\n\u8fd9\u79cd\u65b9\u6cd5\u7684\u5177\u4f53\u63cf\u8ff0\u5982\u4e0b\uff1a\u5047\u8bbe $\\text{maxn}$ \u662f\u5355\u8bcd\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b57\u6bcd\u7684\u51fa\u73b0\u6b21\u6570\uff0c$\\text{minn}$ \u662f\u5355\u8bcd\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u5c11\u7684\u5b57\u6bcd\u7684\u51fa\u73b0\u6b21\u6570\uff0c\u5982\u679c $\\text{maxn}-\\text{minn}$ \u662f\u4e00\u4e2a\u8d28\u6570\uff0c\u90a3\u4e48\u7b28\u5c0f\u7334\u5c31\u8ba4\u4e3a\u8fd9\u662f\u4e2a Lucky Word\uff0c\u8fd9\u6837\u7684\u5355\u8bcd\u5f88\u53ef\u80fd\u5c31\u662f\u6b63\u786e\u7684\u7b54\u6848\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n\u4e00\u4e2a\u5355\u8bcd\uff0c\u5176\u4e2d\u53ea\u53ef\u80fd\u51fa\u73b0\u5c0f\u5199\u5b57\u6bcd\uff0c\u5e76\u4e14\u957f\u5ea6\u5c0f\u4e8e $100$\u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n\u5171\u4e24\u884c\uff0c\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u5047\u8bbe\u8f93\u5165\u7684\u5355\u8bcd\u662f Lucky Word\uff0c\u90a3\u4e48\u8f93\u51fa `Lucky Word`\uff0c\u5426\u5219\u8f93\u51fa `No Answer`\uff1b\n\n\u7b2c\u4e8c\u884c\u662f\u4e00\u4e2a\u6574\u6570\uff0c\u5982\u679c\u8f93\u5165\u7684\u5355\u8bcd\u662f Lucky Word\uff0c\u8f93\u51fa $\\text{maxn}-\\text{minn}$ \u7684\u503c\uff0c\u5426\u5219\u8f93\u51fa $0$\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\nerror\n```\n\n### \u8f93\u51fa #1\n\n```\nLucky Word\n2\n```\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #2\n\n### \u8f93\u5165 #2\n\n```\nolympic\n```\n\n### \u8f93\u51fa #2\n\n```\nNo Answer\n0\n```\n\n## \u8bf4\u660e\/\u63d0\u793a\n\n\u3010\u8f93\u5165\u8f93\u51fa\u6837\u4f8b 1 \u89e3\u91ca\u3011\n\n\u5355\u8bcd `error` \u4e2d\u51fa\u73b0\u6700\u591a\u7684\u5b57\u6bcd $\\texttt r$ \u51fa\u73b0\u4e86 $3$ \u6b21\uff0c\u51fa\u73b0\u6b21\u6570\u6700\u5c11\u7684\u5b57\u6bcd\u51fa\u73b0\u4e86 $1$ \u6b21\uff0c$3-1=2$\uff0c$2$ \u662f\u8d28\u6570\u3002\n\n\u3010\u8f93\u5165\u8f93\u51fa\u6837\u4f8b 2 \u89e3\u91ca\u3011\n\n\u5355\u8bcd `olympic` \u4e2d\u51fa\u73b0\u6700\u591a\u7684\u5b57\u6bcd $\\texttt i$ \u51fa\u73b0\u4e86 $1$ \u6b21\uff0c\u51fa\u73b0\u6b21\u6570\u6700\u5c11\u7684\u5b57\u6bcd\u51fa\u73b0\u4e86 $1$ \u6b21\uff0c$1-1=0$\uff0c$0$ \u4e0d\u662f\u8d28\u6570\u3002\n\n\uff08\u672c\u5904\u539f\u9898\u9762\u9519\u8bef\u5df2\u7ecf\u4fee\u6b63\uff09\n\nnoip2008 \u63d0\u9ad8\u7b2c\u4e00\u9898\n\n---\n\n```c++\n#include <bits>\n#define inf 0x3f3f3f3f\nusing namespace std ;\n\nmap<char int> cnt; \/\/ \u7edf\u8ba1\u6bcf\u4e2a\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\n\n\/\/ \u5224\u65ad\u662f\u5426\u4e3a\u7d20\u6570\nbool judge(int x) {\n    if (x == 0 || x == 1) {\n        return false ;\n    }\n    for (int i = 2 ; i * i <= x ; i ++) {\n        if (x % i == 0) {\n            return false ;\n        }\n    }\n    return true ;\n}\n\nint main() {\n    string s ;\n    cin >> s ;\n    for (auto i : s) {\n        cnt[i] ++ ; \/\/ map\u53ef\u4ee5\u76f4\u63a5\u7528[]\u6765\u8bbf\u95ee\u548c\u4fee\u6539value\n    }\n\n    int minn = inf, maxn = -1 ;\n    for (auto i : s) {\n        minn = min(minn, cnt[i]) ;\n        maxn = max(maxn, cnt[i]) ;\n    }\n\n    if (judge(maxn - minn)) {\n        cout << \"Lucky Word\" << '\\n' ;\n        cout << maxn - minn << '\\n' ;\n    } else {\n        cout << \"No Answer\\n0\\n\" ;\n    }\n    return 0 ;\n}\n```\n\n------\n\n### `queue` (\u961f\u5217)\n\n\u961f\u5217\u662f\u4e00\u79cd**\u5148\u8fdb\u5148\u51fa (FIFO)** \u7684\u6570\u636e\u7ed3\u6784\u3002\u548c\u73b0\u5b9e\u4e2d\u7684\u961f\u5217\u4e00\u4e2a\u6837\uff0c\u4ece\u961f\u5c3e\u6dfb\u52a0\u5143\u7d20\uff0c\u4ece\u961f\u5934\u5220\u9664\u5143\u7d20\u3002\n\n#### \u5b9a\u4e49\n\n```c++\n#include \n<queue>\nqueue\n<typename> name;\n```\n\n#### \u5e38\u7528\u51fd\u6570\n\n- `push(x)`\uff1a\u5c06 `x` \u5165\u961f\uff08\u5230\u961f\u5c3e\uff09\u3002\n- `pop()`\uff1a\u5c06\u961f\u9996\u5143\u7d20\u51fa\u961f\u3002\n- `front()`\uff1a\u8fd4\u56de\u961f\u9996\u5143\u7d20\u3002\n- `back()`\uff1a\u8fd4\u56de\u961f\u5c3e\u5143\u7d20\u3002\n- `size()`\uff1a\u8fd4\u56de\u961f\u5217\u5143\u7d20\u4e2a\u6570\u3002\n- `empty()`\uff1a\u8fd4\u56de\u961f\u5217\u662f\u5426\u4e3a\u7a7a\u3002\u4e3a\u7a7a\u65f6\u8fd4\u56de `true`\u3002\n\n#### \u7ec3\u4e60\n\n[B3616 \u3010\u6a21\u677f\u3011\u961f\u5217 - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/B3616)\n\n# B3616 \u3010\u6a21\u677f\u3011\u961f\u5217\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u8bf7\u4f60\u5b9e\u73b0\u4e00\u4e2a\u961f\u5217\uff08queue\uff09\uff0c\u652f\u6301\u5982\u4e0b\u64cd\u4f5c\uff1a\n\n- `push(x)`\uff1a\u5411\u961f\u5217\u4e2d\u52a0\u5165\u4e00\u4e2a\u6570 $x$\u3002\n- `pop()`\uff1a\u5c06\u961f\u9996\u5f39\u51fa\u3002\u5982\u679c\u6b64\u65f6\u961f\u5217\u4e3a\u7a7a\uff0c\u5219\u4e0d\u8fdb\u884c\u5f39\u51fa\u64cd\u4f5c\uff0c\u5e76\u8f93\u51fa `ERR_CANNOT_POP`\u3002\n- `query()`\uff1a\u8f93\u51fa\u961f\u9996\u5143\u7d20\u3002\u5982\u679c\u6b64\u65f6\u961f\u5217\u4e3a\u7a7a\uff0c\u5219\u8f93\u51fa `ERR_CANNOT_QUERY`\u3002\n- `size()`\uff1a\u8f93\u51fa\u6b64\u65f6\u961f\u5217\u5185\u5143\u7d20\u4e2a\u6570\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n\u7b2c\u4e00\u884c\uff0c\u4e00\u4e2a\u6574\u6570 $n$\uff0c\u8868\u793a\u64cd\u4f5c\u7684\u6b21\u6570\u3002  \n\n\u63a5\u4e0b\u6765 $n$ \u884c\uff0c\u6bcf\u884c\u8868\u793a\u4e00\u4e2a\u64cd\u4f5c\u3002\u683c\u5f0f\u5982\u4e0b\uff1a\n\n- `1 x`\uff0c\u8868\u793a\u5c06\u5143\u7d20 `x` \u52a0\u5165\u961f\u5217\u3002\n- `2`\uff0c\u8868\u793a\u5c06\u961f\u9996\u5f39\u51fa\u961f\u5217\u3002\n- `3`\uff0c\u8868\u793a\u67e5\u8be2\u961f\u9996\u3002\n- `4`\uff0c\u8868\u793a\u67e5\u8be2\u961f\u5217\u5185\u5143\u7d20\u4e2a\u6570\u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n\u8f93\u51fa\u82e5\u5e72\u884c\uff0c\u5bf9\u4e8e\u6bcf\u4e2a\u64cd\u4f5c\uff0c\u6309\u300c\u9898\u76ee\u63cf\u8ff0\u300d\u8f93\u51fa\u7ed3\u679c\u3002\n\n\u6bcf\u6761\u8f93\u51fa\u4e4b\u95f4\u5e94\u5f53\u7528\u7a7a\u884c\u9694\u5f00\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\n13\n1 2\n3\n4\n1 233\n3\n2\n3\n2\n4\n3\n2\n1 144\n3\n```\n\n### \u8f93\u51fa #1\n\n```\n2\n1\n2\n233\n0\nERR_CANNOT_QUERY\nERR_CANNOT_POP\n144\n```\n\n## \u8bf4\u660e\/\u63d0\u793a\n\n### \u6837\u4f8b\u89e3\u91ca\n\n\u9996\u5148\u63d2\u5165 `2`\uff0c\u961f\u9996\u4e3a `2`\u3001\u961f\u5217\u5185\u5143\u7d20\u4e2a\u6570\u4e3a `1`\u3002  \n\u63d2\u5165 `233`\uff0c\u6b64\u65f6\u961f\u9996\u4e3a `2`\u3002  \n\u5f39\u51fa\u961f\u9996\uff0c\u6b64\u65f6\u961f\u9996\u4e3a `233`\u3002  \n\u5f39\u51fa\u961f\u9996\uff0c\u6b64\u65f6\u961f\u9996\u4e3a\u7a7a\u3002  \n\u518d\u6b21\u5c1d\u8bd5\u5f39\u51fa\u961f\u9996\uff0c\u7531\u4e8e\u961f\u5217\u5df2\u7ecf\u4e3a\u7a7a\uff0c\u6b64\u65f6\u65e0\u6cd5\u5f39\u51fa\u3002  \n\u63d2\u5165 `144`\uff0c\u6b64\u65f6\u961f\u9996\u4e3a `144`\u3002  \n\n### \u6570\u636e\u89c4\u6a21\u4e0e\u7ea6\u5b9a\n\n\u5bf9\u4e8e $100\\%$ \u7684\u6d4b\u8bd5\u6570\u636e\uff0c\u6ee1\u8db3 $n\\leq 10000$\uff0c\u4e14\u88ab\u63d2\u5165\u961f\u5217\u7684\u6240\u6709\u5143\u7d20\u503c\u662f $[1, 1000000]$ \u4ee5\u5185\u7684\u6b63\u6574\u6570\u3002\n\n---\n\n```c++\n#include <bits>\nusing namespace std ;\n\nint main() {\n    int n ;\n    cin >> n ;\n    queue\n<int> q ;\n\n    while (n --) {\n        int op ;\n        cin >> op ;\n        if (op == 1) {\n            int x ;\n            cin >> x ;\n            q.push(x) ;\n        } else if (op == 2) {\n            if (q.empty()) {\n                cout << \"ERR_CANNOT_POP\" << '\\n' ;\n            } else {\n                q.pop() ;\n            }\n        } else if (op == 3) {\n            if (q.empty()) {\n                cout << \"ERR_CANNOT_QUERY\" << '\\n' ;\n            } else {\n                cout << q.front() << '\\n' ;\n            }\n        } else {\n            cout << q.size() << '\\n' ;\n        }\n    }\n    return 0 ;\n}\n```\n\n------\n\n### `stack` (\u6808)\n\n\u6808\u662f\u4e00\u79cd**\u5148\u8fdb\u540e\u51fa (LIFO)** \u7684\u6570\u636e\u7ed3\u6784\uff0c\u5e76\u4e14\u53ea\u80fd\u5728\u6808\u9876\u8fdb\u884c\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u3002\n\n#### \u5b9a\u4e49\n\n```c++\n#include \n<stack>\nstack\n<typename> name;\n```\n\n#### \u5e38\u7528\u51fd\u6570\n\n- `push(x)`\uff1a\u5c06 `x` \u538b\u5165\u6808\uff08\u5230\u6808\u9876\uff09\u3002\n- `pop()`\uff1a\u5c06\u6808\u9876\u5143\u7d20\u5f39\u51fa\u3002\n- `top()`\uff1a\u8fd4\u56de\u6808\u9876\u5143\u7d20\u3002\n- `size()`\uff1a\u8fd4\u56de\u6808\u4e2d\u5143\u7d20\u4e2a\u6570\u3002\n- `empty()`\uff1a\u8fd4\u56de\u6808\u662f\u5426\u4e3a\u7a7a\u3002\n\n#### \u7ec3\u4e60\n\n[B3614 \u3010\u6a21\u677f\u3011\u6808 - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/B3614)\n\n# B3614 \u3010\u6a21\u677f\u3011\u6808\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u8bf7\u4f60\u5b9e\u73b0\u4e00\u4e2a\u6808\uff08stack\uff09\uff0c\u652f\u6301\u5982\u4e0b\u64cd\u4f5c\uff1a\n\n- `push(x)`\uff1a\u5411\u6808\u4e2d\u52a0\u5165\u4e00\u4e2a\u6570 $x$\u3002\n- `pop()`\uff1a\u5c06\u6808\u9876\u5f39\u51fa\u3002\u5982\u679c\u6b64\u65f6\u6808\u4e3a\u7a7a\u5219\u4e0d\u8fdb\u884c\u5f39\u51fa\u64cd\u4f5c\uff0c\u8f93\u51fa `Empty`\u3002\n- `query()`\uff1a\u8f93\u51fa\u6808\u9876\u5143\u7d20\uff0c\u5982\u679c\u6b64\u65f6\u6808\u4e3a\u7a7a\u5219\u8f93\u51fa `Anguei!`\u3002\n- `size()`\uff1a\u8f93\u51fa\u6b64\u65f6\u6808\u5185\u5143\u7d20\u4e2a\u6570\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n**\u672c\u9898\u5355\u6d4b\u8bd5\u70b9\u5185\u6709\u591a\u7ec4\u6570\u636e**\u3002  \n\u8f93\u5165\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570 $T$\uff0c\u8868\u793a\u6570\u636e\u7ec4\u6570\u3002\u5bf9\u4e8e\u6bcf\u7ec4\u6570\u636e\uff0c\u683c\u5f0f\u5982\u4e0b\uff1a  \n\u6bcf\u7ec4\u6570\u636e\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u64cd\u4f5c\u7684\u6b21\u6570 $n$\u3002  \n\u63a5\u4e0b\u6765 $n$ \u884c\uff0c\u6bcf\u884c\u9996\u5148\u7531\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u4e3a `push`\uff0c`pop`\uff0c`query` \u548c `size` \u4e4b\u4e00\u3002\u82e5\u4e3a `push`\uff0c\u5219\u5176\u540e\u6709\u4e00\u4e2a\u6574\u6570 $x$\uff0c\u8868\u793a\u8981\u88ab\u52a0\u5165\u7684\u6570\uff0c$x$ \u548c\u5b57\u7b26\u4e32\u4e4b\u95f4\u7528\u7a7a\u683c\u9694\u5f00\uff1b\u82e5\u4e0d\u662f `push`\uff0c\u5219\u672c\u884c\u6ca1\u6709\u5176\u5b83\u5185\u5bb9\u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n\u5bf9\u4e8e\u6bcf\u7ec4\u6570\u636e\uff0c\u6309\u7167\u300c\u9898\u76ee\u63cf\u8ff0\u300d\u4e2d\u7684\u8981\u6c42\u4f9d\u6b21\u8f93\u51fa\u3002\u6bcf\u6b21\u8f93\u51fa\u5360\u4e00\u884c\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\n2\n5\npush 2\nquery\nsize\npop\nquery\n3\npop\nquery\nsize\n```\n\n### \u8f93\u51fa #1\n\n```\n2\n1\nAnguei!\nEmpty\nAnguei!\n0\n```\n\n## \u8bf4\u660e\/\u63d0\u793a\n\n### \u6837\u4f8b 1 \u89e3\u91ca\n\n\u5bf9\u4e8e\u7b2c\u4e8c\u7ec4\u6570\u636e\uff0c\u59cb\u7ec8\u4e3a\u7a7a\uff0c\u6240\u4ee5 `pop` \u548c `query` \u5747\u9700\u8981\u8f93\u51fa\u5bf9\u5e94\u5b57\u7b26\u4e32\u3002\u6808\u7684 size \u4e3a 0\u3002\n\n### \u6570\u636e\u89c4\u6a21\u4e0e\u7ea6\u5b9a\n\n\u5bf9\u4e8e\u5168\u90e8\u7684\u6d4b\u8bd5\u70b9\uff0c\u4fdd\u8bc1 $1 \\leq T, n\\leq 10^6$\uff0c\u4e14\u5355\u4e2a\u6d4b\u8bd5\u70b9\u5185\u7684 $n$ \u4e4b\u548c\u4e0d\u8d85\u8fc7 $10^6$\uff0c\u5373 $\\sum n \\leq 10^6$\u3002\u4fdd\u8bc1 $0 \\leq x \\lt 2^{64}$\u3002\n\n### \u63d0\u793a\n\n- \u8bf7\u6ce8\u610f\u5927\u91cf\u6570\u636e\u8bfb\u5165\u5bf9\u7a0b\u5e8f\u6548\u7387\u9020\u6210\u7684\u5f71\u54cd\u3002\n- \u56e0\u4e3a\u4e00\u5f00\u59cb\u6570\u636e\u9020\u9519\u4e86\uff0c\u8bf7\u6ce8\u610f\u8f93\u51fa\u7684 `Empty` \u4e0d\u542b\u53f9\u53f7\uff0c`Anguei!` \u542b\u6709\u53f9\u53f7\u3002\n\n---\n\n```c++\n#include <bits>\n#define int unsigned long long \n\/\/ \n\/\/ \n\/\/ \nusing namespace std ;\n\nvoid solve() {\n    stack\n<int> s ;\n    int n ;\n    cin >> n ;\n    while (n --) {\n        string ss ;\n        cin >> ss ;\n        if (ss == \"push\") {\n            int x ;\n            cin >> x ;\n            s.push(x) ;\n        } else if (ss == \"pop\") {\n            if (s.empty()) {\n                cout << \"Empty\" << '\\n' ;\n            } else {\n                s.pop() ;\n            }\n        } else if (ss == \"query\") {\n            if (s.empty()) {\n                cout << \"Anguei!\" << '\\n' ;\n            } else {\n                cout << s.top() << '\\n' ;\n            }\n        } else { \/\/ \"size\"\n            cout << s.size() << '\\n' ;\n        }\n    }\n}\n\nsigned main() {\n    ios::sync_with_stdio(false) ; \/\/ \u52a0\u901fcin\n    cin.tie(0) ; \/\/ \u89e3\u9664cin\u548ccout\u7684\u7ed1\u5b9a\n    int T ;\n    cin >> T ;\n    while (T --) {\n        solve() ;\n    }\n    return 0 ;\n}\n```\n\n------\n\n### `set` (\u96c6\u5408)\n\nSet \u96c6\u5408\uff0c\u662f\u4e00\u4e2a\u5185\u90e8\u81ea\u52a8\u6709\u5e8f\u4e14\u4e0d\u542b\u91cd\u590d\u5143\u7d20\u7684\u5bb9\u5668\u3002\u82e5\u63d2\u5165\u91cd\u590d\u5143\u7d20\uff0c\u4f1a\u81ea\u52a8\u5ffd\u7565\u8be5\u6b21\u63d2\u5165\u64cd\u4f5c\uff0c\u5e76\u4e14 set \u91cc\u9762\u7684\u5143\u7d20\u81ea\u52a8\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u3002\n\n#### \u5b9a\u4e49\n\n```c++\n#include \n<set>\nset\n<typename> name;\n```\n\n#### \u8bbf\u95ee\n\nSet \u53ea\u80fd\u901a\u8fc7\u8fed\u4ee3\u5668\u8bbf\u95ee\u3002\n\n```c++\nset\n<int> st;\n\/\/ ... \u63d2\u5165\u5143\u7d20 ...\n\n\/\/ 1. \u8fed\u4ee3\u5668\nset\n<int>::iterator it; \nfor(it = st.begin(); it != st.end(); it++) {\n    printf(\"%d\", *it); \/\/ \u53ef\u4ee5\u901a\u8fc7 *it \u6765\u8bbf\u95ee set \u91cc\u7684\u5143\u7d20\n}\n\n\/\/ 2. C++11 \n\/\/ \n\/\/ \n\/\/ \nfor(auto i : st) {\n    printf(\"%d\", i);\n}\n```\n\n#### \u5e38\u7528\u51fd\u6570\n\n- `insert(x)`\uff1a\u5c06 `x` \u63d2\u5165 set \u4e2d\uff0c\u5e76\u81ea\u52a8\u9012\u589e\u6392\u5e8f\u548c\u53bb\u91cd\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(logN)\u3002\n- `find(x)`\uff1a\u8fd4\u56de set \u4e2d\u503c\u4e3a `x` \u7684\u8fed\u4ee3\u5668\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(logN)\u3002\u5982\u679c\u627e\u4e0d\u5230\uff0c\u8fd4\u56de `s.end()`\u3002\n- `erase(it)`\uff1a`it` \u4e3a\u6240\u9700\u8981\u5220\u9664\u5143\u7d20\u7684\u8fed\u4ee3\u5668\u3002\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(1)\u3002\n- `erase(x)`\uff1a\u5220\u9664\u503c\u4e3a `x` \u7684\u5143\u7d20\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(logN)\u3002\n- `erase(first, last)`\uff1a\u5220\u9664\u533a\u95f4 `[first, last)` \u5185\u7684\u5143\u7d20\uff0c`first`, `last` \u4e3a\u8fed\u4ee3\u5668\u3002\n- `size()`\uff1a\u8fd4\u56de set \u5185\u5143\u7d20\u4e2a\u6570\u3002\n- `clear()`\uff1a\u6e05\u7a7a set \u4e2d\u7684\u6240\u6709\u5143\u7d20\u3002\n\n#### \u7ec3\u4e60\n\n[P1138 \u7b2c k \u5c0f\u6574\u6570 - \u6d1b\u8c37](https:\/\/www.luogu.com.cn\/problem\/P1138)\n\n# P1138 \u7b2c k \u5c0f\u6574\u6570\n\n## \u9898\u76ee\u63cf\u8ff0\n\n\u73b0\u6709 $n$ \u4e2a\u6b63\u6574\u6570\uff0c\u8981\u6c42\u51fa\u8fd9 $n$ \u4e2a\u6b63\u6574\u6570\u4e2d\u7684\u7b2c $k$ \u4e2a\u6700\u5c0f\u6574\u6570\uff08\u76f8\u540c\u5927\u5c0f\u7684\u6574\u6570\u53ea\u8ba1\u7b97\u4e00\u6b21\uff09\u3002\n\n## \u8f93\u5165\u683c\u5f0f\n\n\u7b2c\u4e00\u884c\u4e3a $n$ \u548c $k$; \u7b2c\u4e8c\u884c\u5f00\u59cb\u4e3a $n$ \u4e2a\u6b63\u6574\u6570\u7684\u503c\uff0c\u6574\u6570\u95f4\u7528\u7a7a\u683c\u9694\u5f00\u3002\n\n## \u8f93\u51fa\u683c\u5f0f\n\n\u7b2c$k$\u4e2a\u6700\u5c0f\u6574\u6570\u7684\u503c\uff1b\u82e5\u65e0\u89e3\uff0c\u5219\u8f93\u51fa `NO RESULT`\u3002\n\n## \u8f93\u5165\u8f93\u51fa\u6837\u4f8b #1\n\n### \u8f93\u5165 #1\n\n```\n10 3\n1 3 3 7 2 5 1 2 4 6\n```\n\n### \u8f93\u51fa #1\n\n```\n3\n```\n\n## \u8bf4\u660e\/\u63d0\u793a\n\n$n \\leq 10000$\uff0c$k \\leq 4000$\uff0c\u6b63\u6574\u6570\u5747\u5c0f\u4e8e $30000$\u3002\n\n---\n\n\u65b9\u6cd5\u4e00 (\u4f7f\u7528 set):\n\nset \u81ea\u52a8\u6392\u5e8f\u548c\u53bb\u91cd\uff0c\u975e\u5e38\u9002\u5408\u8fd9\u9053\u9898\u3002\n\n```c++\n#include <bits>\nusing namespace std ;\n\nint main() {\n    set\n<int> s ;\n    int n, k ;\n    cin >> n >> k ;\n\n    for (int i = 1 ; i <= n ; i ++) {\n        int x ;\n        cin >> x ;\n        s.insert(x) ; \/\/ \u81ea\u52a8\u53bb\u91cd\u548c\u6392\u5e8f\n    }\n\n    if (k > s.size()) { \/\/ \u5982\u679ck\u5927\u4e8e\u53bb\u91cd\u540e\u7684\u5143\u7d20\u4e2a\u6570\n        cout << \"NO RESULT\" << '\\n' ;\n    } else {\n        int pos = 1 ;\n        for (auto i : s) { \/\/ \u904d\u5386set\n            if (pos == k) {\n                cout << i << '\\n' ;\n                break ;\n            }\n            pos ++ ;\n        }\n    }\n    return 0 ;\n}\n```\n\n\u65b9\u6cd5\u4e8c (\u4f7f\u7528 vector + map \u6216 bool \u6570\u7ec4\u53bb\u91cd):\n\n\u624b\u52a8\u53bb\u91cd\uff0c\u7136\u540e\u6392\u5e8f\u3002\n\n```c++\n#include <bits>\nusing namespace std ;\n\nmap<int bool> vis ; \/\/ \u7528map\u6807\u8bb0\u662f\u5426\u51fa\u73b0\u8fc7\n\nint main() {\n    vector\n<int> a ;\n    int n, k ;\n    cin >> n >> k ;\n\n    for (int i = 1 ; i <= n ; i ++) {\n        int x ;\n        cin >> x ;\n        if (vis[x]) { \/\/ \u5982\u679c\u51fa\u73b0\u8fc7\n            continue ;\n        }\n        vis[x] = true ; \/\/ \u6807\u8bb0\u4e3a\u51fa\u73b0\u8fc7\n        a.push_back(x) ;\n    }\n\n    if (k > a.size()) {\n        cout << \"NO RESULT\" << '\\n' ;\n    } else {\n        sort(a.begin(), a.end()) ; \/\/ \u6392\u5e8f\n        cout << a[k - 1] << '\\n' ; \/\/ vector\u4e0b\u6807\u4ece0\u5f00\u59cb\uff0c\u7b2ck\u4e2a\u662f a[k-1]\n    }\n    return 0 ;\n}\n```<\/int><\/int><\/bits><\/int><\/bits><\/int><\/int><\/typename><\/set><\/int><\/bits><\/typename><\/stack><\/int><\/bits><\/typename><\/queue><\/char><\/bits><\/int><\/int><\/int><\/map><\/string><\/int><\/bits><\/int><\/int><\/int><\/typename><\/vector><\/bits><\/int><\/int><\/algorithm><\/iostream><\/algorithm>","protected":false},"excerpt":{"rendered":"<p>STL (Standard Template Library)\uff1a\u662f C++ \u6807\u51c6\u5e93\u7684\u91cd\u8981\u7ec4\u6210\u90e8\u5206\uff0c\u4e0d\u4ec5\u662f\u4e00\u4e2a\u53ef\u590d\u7528\u7684\u7ec4\u4ef6\u5e93\uff0c\u800c\u4e14\u662f &#8230;<\/p>","protected":false},"author":1,"featured_media":174,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"emotion":"","emotion_color":"","title_style":"","license":"","footnotes":""},"categories":[25],"tags":[],"class_list":["post-200","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-25"],"_links":{"self":[{"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/posts\/200","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/comments?post=200"}],"version-history":[{"count":4,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/posts\/200\/revisions"}],"predecessor-version":[{"id":206,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/posts\/200\/revisions\/206"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/media\/174"}],"wp:attachment":[{"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/media?parent=200"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/categories?post=200"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/caoxunyi.cn\/index.php\/wp-json\/wp\/v2\/tags?post=200"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}