{"id":2622,"date":"2023-04-26T03:20:05","date_gmt":"2023-04-25T19:20:05","guid":{"rendered":"https:\/\/www.shuizilong.com\/house\/?p=2622"},"modified":"2023-04-26T03:42:35","modified_gmt":"2023-04-25T19:42:35","slug":"atcoder-beginner-contest-299","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/atcoder-beginner-contest-299\/","title":{"rendered":"AtCoder Beginner Contest 299"},"content":{"rendered":"<ul>\n<li><a href=\"https:\/\/www.cnblogs.com\/Lanly\/p\/17344724.html\">https:\/\/www.cnblogs.com\/Lanly\/p\/17344724.html<\/a><\/li>\n<\/ul>\n<h1>Problem D. Find by Query<\/h1>\n<p>\u7b80\u5355\u4e8c\u5206\u3002<\/p>\n<h1>Problem E. Nearest Black Vertex<\/h1>\n<p>\u9996\u5148\u5708\u5185\u7684\u70b9\u5fc5\u987b\u5168\u90e8\u67d3\u767d\uff0c\u5426\u5219\u4e0d\u6ee1\u8db3\u6761\u4ef6\u3002<br \/>\n\u7136\u540e\u6700\u4f18\u72b6\u6001\u4e00\u5b9a\u662f\u5269\u4e0b\u70b9\u5168\u662f\u9ed1\uff0c\u5982\u679c\u8fd9\u4e5f\u4e0d\u6ee1\u8db3\u6761\u4ef6\u90a3\u4e48\u4e00\u5b9a\u65e0\u89e3\u4e86\u3002<br \/>\n\u6240\u4ee5\u53ea\u8981\u4e24\u4e2a bfs() \u5206\u522b\u67d3\u8272\u548c\u68c0\u67e5\u5373\u53ef\u3002\u3002<\/p>\n<h1>Problem F. Square Subsequence<\/h1>\n<p>\u4e00\u822c\u7684 idea \u662f\u5b50\u4e32\u95ee\u9898\u548c\u5b57\u7b26\u4e32\u7b97\u6cd5\u6709\u5173\uff0c\u5b50\u5e8f\u5217\u95ee\u9898\u548c\u52a8\u6001\u89c4\u5212\u6709\u5173\u3002<br \/>\n\u7136\u540e\u9996\u5148\u5f97\u4f1a\u505a\u4e00\u4e2a\u4e32\u7248\u672c\u7684\uff0c\u65e2\u7ed9\u5b9a\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u5224\u65ad\u6709\u591a\u5c11\u4e0d\u91cd\u590d\u7684\u5b50\u5e8f\u5217\u3002<\/p>\n<p>\u8fd9\u662f\u4e00\u4e2a\u7ecf\u5178\u95ee\u9898\u3002<a href=\"https:\/\/leetcode.cn\/problems\/distinct-subsequences-ii\/\">https:\/\/leetcode.cn\/problems\/distinct-subsequences-ii\/<\/a><\/p>\n<p>\u96be\u70b9\u5728\u4e8e\u8ba1\u6570\u7684\u65f6\u5019\u5982\u4f55<strong>\u4e0d\u91cd\u4e0d\u6f0f<\/strong>\uff0c\u65b9\u6cd5\u5c31\u662f\u5bf9\u4e8e\u540c\u4e00\u4e2a\u7b49\u4ef7\u7c7b\u4e2d\u7684\u6240\u6709\u5143\u7d20\uff0c\u6211\u4eec\u627e\u5230\u4e00\u4e2a\u4ee3\u8868\u5143\uff0c\u5728\u8fd9\u91cc\u6211\u4eec\u5f53\u7136\u627e\u51fa\u73b0\u65f6\u523b\u6700\u65e9\u7684\uff0c\u7136\u540e dp \u7684\u65f6\u5019\u5bf9\u4e8e\u6bcf\u4e2a\u5b57\u7b26\u53ea\u8981\u4ece\u6700\u665a\u65f6\u523b\u8f6c\u79fb\u8fc7\u6765\u5373\u53ef\uff08\u665a\u51fa\u73b0\u5bf9\u4e8e\u65e9\u51fa\u73b0\u7684\u8ba1\u6570\u5b58\u5728\u5305\u542b\u5173\u7cfb\uff09\u3002<br \/>\n\u8fd9\u6837\u8fd9\u4e2a dp \u8fc7\u7a0b\u5c31\u662f\u4e00\u4e2a\u7b80\u5355\u7684\u5728 dag \u4e0a\u7684\u8f6c\u79fb\u3002<\/p>\n<p>\u518d\u6765\u8003\u8651\u8fd9\u4e2a\u95ee\u9898\u3002<br \/>\n\u4e00\u4e2a\u7b80\u5355\u7684\u60f3\u6cd5\u662f dp[i][j] \u8868\u793a\u7b2c\u4e00\u4e2a\u4e32\u7684\u672b\u5c3e\u662f i\uff0c\u7b2c\u4e8c\u4e2a\u4e32\u7684\u672b\u5c3e\u662f j \u7684\u65b9\u6848\u6570\u3002<br \/>\n\u4f46\u6211\u4eec\u6ca1\u6cd5\u5411\u4e0a\u9762\u7684 dp \u65b9\u6cd5\u4e00\u6837\u7b80\u5355\u5b8c\u6210\u53bb\u91cd\uff08\u8003\u5bdf aaa\uff09\u3002<\/p>\n<p>\u4f46\u662f\u9047\u4e8b\u4e0d\u51b3\u6211\u4eec\u53ef\u4ee5\u66b4\u529b\u679a\u4e3e\u3002\u3002\u3002\u679a\u4e3e\u7684\u4f4d\u7f6e\u5f53\u7136\u662f\u7b2c\u4e8c\u4e2a\u4e32\u7684\u521d\u59cb\u4f4d\u7f6e\u3002\u3002\u3002<br \/>\n\u8fd9\u6837\u5728 dp \u4e4b\u540e\uff0c\u6211\u4eec\u53ea\u9700\u8981\u68c0\u67e5\u7b2c\u4e00\u4e2a\u4e32\u7684\u7ed3\u5c3e\u7684\u4e0b\u4e00\u4e2a\u6700\u63a5\u8fd1\u7684\u7b2c\u4e8c\u4e2a\u4e32\u7684\u5f00\u59cb\u5b57\u7b26\u7684\u4f4d\u7f6e\u6070\u597d\u662f\u6211\u4eec\u679a\u4e3e\u7684\u4f4d\u7f6e\u5373\u53ef\u3002\u3002<br \/>\n\u8fd9\u6837\u5c31\u4ee5\u590d\u6742\u5ea6\u52a0\u4e00\u7ef4\u7684\u4ee3\u4ef7\u8f7b\u677e\u7684\u89e3\u51b3\u4e86\u8fd9\u4e2a\u95ee\u9898\u3002\uff08\u7136\u540e\u628a\u5012\u63a8\u6539\u6210\u987a\u63a8\u3002\u3002\uff09<\/p>\n<h1>Problem G. Minimum Permutation<\/h1>\n<p>\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5c0f\uff0c\u8ba9\u4eba\u60f3\u8d77 <a href=\"https:\/\/darkbzoj.cc\/problem\/1931\">\u8fd9\u4e2a\u9898<\/a>\u3002<br \/>\n\u7b2c\u4e00\u60f3\u6cd5\u662f\u8d2a\u5fc3\u6784\u9020\uff0c\u6211\u4eec\u6bcf\u4e00\u6b65\u5bfb\u627e\u5f53\u524d\u4f4d\u7f6e\u6240\u80fd\u53d6\u7684\u6700\u5c0f\u7684\u6570\u3002<\/p>\n<pre class=\"brush: cpp; light: false; title: ; toolbar: true; notranslate\" title=\"\">\r\n#include &lt;lastweapon\/io&gt;\r\nusing namespace lastweapon;\r\nconst int N = int(2e5) + 9;\r\nSI t, c; VI a&#x5B;N];\r\nint n, m, p;\r\n\r\nbool ok(int x) {\r\n    int p = *lower_bound(ALL(a&#x5B;x]), ::p);\r\n    return *c.begin() &gt;= p;\r\n}\r\n\r\nint main() {\r\n#ifndef ONLINE_JUDGE\r\n    freopen(&quot;in.txt&quot;, &quot;r&quot;, stdin);\r\n#endif\r\n\r\n    RD(n, m); REP(i, n) a&#x5B;RD()].PB(i);\r\n    REP_1(i, m) t.insert(i), c.insert(a&#x5B;i].back()); p = 0;\r\n\r\n    while (!t.empty()) {\r\n        for (auto x: t) if (ok(x)) {\r\n            p = *lower_bound(ALL(a&#x5B;x]), p);\r\n            printf(&quot;%d &quot;, x); t.erase(x); c.erase(a&#x5B;x].back());\r\n            break;\r\n        }\r\n    }\r\n}\r\n<\/pre>\n<p>\u9057\u61be\u7684\u662f\uff0c\u6bcf\u4e00\u6b65\u6211\u4eec\u90fd\u8981\u4e00\u4e2a\u4e00\u4e2a\u8003\u5bdf\u6240\u6709\u5907\u9009\u60c5\u51b5\uff0c\u6240\u4ee5\u590d\u6742\u5ea6\u662f O(n^2logn)\uff0c\u4f1a TLE\u3002<br \/>\n\u7136\u540e\u6709\u4e00\u4e2a\u975e\u5e38\u5de7\u5999\u7684\u57fa\u4e8e\u6808\u7684\u65b9\u6cd5\u3002<\/p>\n<p>\u6211\u7b2c\u4e00\u53cd\u5e94\u662f <a href=\"https:\/\/atcoder.jp\/contests\/abc299\/submissions\/40948767\">\u62ff\u4e00\u4e2a deque \u8bb0\u5f55\u5907\u9009\u96c6\u5408\uff0c\u518d\u7528\u4e00\u4e2a set \u8bb0\u5f55\u5269\u4e0b\u5143\u7d20\u6700\u665a\u51fa\u73b0\u65f6\u523b<\/a>\uff0c\u4f46\u662f\u8bfb\u4e86 <a href=\"https:\/\/atcoder.jp\/contests\/abc299\/submissions\/40816554\">kyopro_friends \u7684\u4ee3\u7801<\/a> \u4e4b\u540e\u53d1\u73b0\u8fd9\u4e9b\u5176\u5b9e\u90fd\u662f\u4e0d\u9700\u8981\u7684\uff08\u56e7\uff09<br \/>\n\u53ea\u9700\u6309\u987a\u5e8f\u626b\u63cf\u6bcf\u4e00\u4e2a\u4f4d\u7f6e\uff0c\u5e76\u7528\u4e00\u4e2a\u6808\u7ef4\u62a4\u5f53\u524d\u7684\u7b54\u6848\uff0c\u5f53\u65b0\u52a0\u5165\u7684\u6570\u5b57\u6bd4\u6808\u9876\u5143\u7d20\u66f4\u4f18\uff0c\u4e14\u4e0d\u5f71\u54cd\u89e3\u7684\u5b58\u5728\u6027\u65f6\uff0c\u5f39\u51fa\u6808\u9876\u5143\u7d20\u5373\u53ef\u3002<br \/>\n\u800c\u89e3\u7684\u5b58\u5728\u6027\u53ea\u9700\u8981\u8bb0\u5f55\u5f53\u524d\u6808\u9876\u5143\u7d20\u6700\u665a\u51fa\u73b0\u7684\u65f6\u523b\u5373\u53ef\uff0c\u590d\u6742\u5ea6\u7ebf\u6027\u3002<\/p>\n<pre class=\"brush: cpp; light: false; title: ; toolbar: true; notranslate\" title=\"\">\r\n#include &lt;lastweapon\/io&gt;\r\nusing namespace lastweapon;\r\nconst int N = int(2e5) + 9;\r\nint a&#x5B;N], r&#x5B;N]; stack&lt;int&gt; s; bool used&#x5B;N];\r\nint n, m;\r\n\r\nint main() {\r\n#ifndef ONLINE_JUDGE\r\n    freopen(&quot;in.txt&quot;, &quot;r&quot;, stdin);\r\n#endif\r\n\r\n    RD(n, m); REP(i, n) r&#x5B;RD(a&#x5B;i])] = i;\r\n#define x a&#x5B;i]\r\n#define y s.top()\r\n    REP(i, n) if (!used&#x5B;x]) {\r\n        used&#x5B;x] = 1;\r\n        while (!s.empty() &amp;&amp; x &lt; y &amp;&amp; r&#x5B;y] &gt; i) {\r\n            used&#x5B;y] = 0;\r\n            s.pop();\r\n        }\r\n        s.push(x);\r\n    }\r\n    DWN(i, m, 0) {\r\n        a&#x5B;i] = y;\r\n        s.pop();\r\n    }\r\n    REP(i, m) printf(&quot;%d &quot;, x);\r\n}\r\n<\/pre>\n<h1>Problem Ex.<\/h1>\n<p><a href=\"https:\/\/atcoder.jp\/contests\/abc299\/submissions\/40868354\">https:\/\/atcoder.jp\/contests\/abc299\/submissions\/40868354<\/a><br \/>\n\u770b\u5230 berlekampMassey() \u6211\u5c31\u5413\u50bb\u4e86\uff0c\u4f46\u662f\u5e94\u8be5\u6ca1\u7528\u5427&#8230;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>https:\/\/www.cnblogs.com\/Lanly\/p\/17344724.html Problem D. Find by Query \u7b80\u5355\u4e8c\u5206\u3002 Problem E. Nearest Black Vertex \u9996\u5148\u5708\u5185\u7684\u70b9\u5fc5\u987b\u5168\u90e8\u67d3\u767d\uff0c\u5426\u5219\u4e0d\u6ee1\u8db3\u6761\u4ef6\u3002 \u7136\u540e\u6700\u4f18\u72b6\u6001\u4e00\u5b9a\u662f\u5269\u4e0b\u70b9\u5168\u662f\u9ed1\uff0c\u5982\u679c\u8fd9\u4e5f\u4e0d\u6ee1\u8db3\u6761\u4ef6\u90a3\u4e48\u4e00\u5b9a\u65e0\u89e3\u4e86\u3002 \u6240\u4ee5\u53ea\u8981\u4e24\u4e2a bfs() \u5206\u522b\u67d3\u8272\u548c\u68c0\u67e5\u5373\u53ef\u3002\u3002 Problem F. Square Subsequence \u4e00\u822c\u7684 idea \u662f\u5b50\u4e32\u95ee\u9898\u548c\u5b57\u7b26\u4e32\u7b97\u6cd5\u6709\u5173\uff0c\u5b50\u5e8f\u5217\u95ee\u9898\u548c\u52a8\u6001\u89c4\u5212\u6709\u5173\u3002 \u7136\u540e\u9996\u5148\u5f97\u4f1a\u505a\u4e00\u4e2a\u4e32\u7248\u672c\u7684\uff0c\u65e2\u7ed9\u5b9a\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u5224\u65ad\u6709\u591a\u5c11\u4e0d\u91cd\u590d\u7684\u5b50\u5e8f\u5217\u3002 \u8fd9\u662f\u4e00\u4e2a\u7ecf\u5178\u95ee\u9898\u3002https:\/\/leetcode.cn\/problems\/distinct-subsequences-ii\/ \u96be\u70b9\u5728\u4e8e\u8ba1\u6570\u7684\u65f6\u5019\u5982\u4f55\u4e0d\u91cd\u4e0d\u6f0f\uff0c\u65b9\u6cd5\u5c31\u662f\u5bf9\u4e8e\u540c\u4e00\u4e2a\u7b49\u4ef7\u7c7b\u4e2d\u7684\u6240\u6709\u5143\u7d20\uff0c\u6211\u4eec\u627e\u5230\u4e00\u4e2a\u4ee3\u8868\u5143\uff0c\u5728\u8fd9\u91cc\u6211\u4eec\u5f53\u7136\u627e\u51fa\u73b0\u65f6\u523b\u6700\u65e9\u7684\uff0c\u7136\u540e dp \u7684\u65f6\u5019\u5bf9\u4e8e\u6bcf\u4e2a\u5b57\u7b26\u53ea\u8981\u4ece\u6700\u665a\u65f6\u523b\u8f6c\u79fb\u8fc7\u6765\u5373\u53ef\uff08\u665a\u51fa\u73b0\u5bf9\u4e8e\u65e9\u51fa\u73b0\u7684\u8ba1\u6570\u5b58\u5728\u5305\u542b\u5173\u7cfb\uff09\u3002 \u8fd9\u6837\u8fd9\u4e2a dp \u8fc7\u7a0b\u5c31\u662f\u4e00\u4e2a\u7b80\u5355\u7684\u5728 dag \u4e0a\u7684\u8f6c\u79fb\u3002 \u518d\u6765\u8003\u8651\u8fd9\u4e2a\u95ee\u9898\u3002 \u4e00\u4e2a\u7b80\u5355\u7684\u60f3\u6cd5\u662f dp[i][j] \u8868\u793a\u7b2c\u4e00\u4e2a\u4e32\u7684\u672b\u5c3e\u662f i\uff0c\u7b2c\u4e8c\u4e2a\u4e32\u7684\u672b\u5c3e\u662f j \u7684\u65b9\u6848\u6570\u3002 \u4f46\u6211\u4eec\u6ca1\u6cd5\u5411\u4e0a\u9762\u7684 dp \u65b9\u6cd5\u4e00\u6837\u7b80\u5355\u5b8c\u6210\u53bb\u91cd\uff08\u8003\u5bdf aaa\uff09\u3002 \u4f46\u662f\u9047\u4e8b\u4e0d\u51b3\u6211\u4eec\u53ef\u4ee5\u66b4\u529b\u679a\u4e3e\u3002\u3002\u3002\u679a\u4e3e\u7684\u4f4d\u7f6e\u5f53\u7136\u662f\u7b2c\u4e8c\u4e2a\u4e32\u7684\u521d\u59cb\u4f4d\u7f6e\u3002\u3002\u3002 \u8fd9\u6837\u5728 dp \u4e4b\u540e\uff0c\u6211\u4eec\u53ea\u9700\u8981\u68c0\u67e5\u7b2c\u4e00\u4e2a\u4e32\u7684\u7ed3\u5c3e\u7684\u4e0b\u4e00\u4e2a\u6700\u63a5\u8fd1\u7684\u7b2c\u4e8c\u4e2a\u4e32\u7684\u5f00\u59cb\u5b57\u7b26\u7684\u4f4d\u7f6e\u6070\u597d\u662f\u6211\u4eec\u679a\u4e3e\u7684\u4f4d\u7f6e\u5373\u53ef\u3002\u3002 \u8fd9\u6837\u5c31\u4ee5\u590d\u6742\u5ea6\u52a0\u4e00\u7ef4\u7684\u4ee3\u4ef7\u8f7b\u677e\u7684\u89e3\u51b3\u4e86\u8fd9\u4e2a\u95ee\u9898\u3002\uff08\u7136\u540e\u628a\u5012\u63a8\u6539\u6210\u987a\u63a8\u3002\u3002\uff09 Problem G. Minimum Permutation \u6784\u9020\u5b57\u5178\u5e8f\u6700\u5c0f\uff0c\u8ba9\u4eba\u60f3\u8d77 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-2622","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-Gi","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2622","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=2622"}],"version-history":[{"count":6,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2622\/revisions"}],"predecessor-version":[{"id":2628,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2622\/revisions\/2628"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=2622"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=2622"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=2622"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}