\u96be\u5ea6<\/strong>\u53c2\u8003\u6d1b\u8c37\u8bc4\u6d4b<\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n \u8bf4\u660e\/\u80cc\u666f \u6b64\u6587\u4ec5\u4e3a\u4f5c\u8005\u7684\u4e2a\u4eba\u89c1\u89e3\uff0c\u539f\u9898\u4e3a\u7b2c\u5341\u516d\u5c4a\u84dd\u6865\u676f\u7701\u8d5bc++b\u7ec4\u539f\u9898\u3002\u53ef\u4ee5\u5728\u4ee5\u4e0b\u94fe\u63a5\u627e\u5230\u5bf9\u5e94\u7684\u8bc4\u6d4b\uff1ahttps:\/\/www. …<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"emotion":"","emotion_color":"","title_style":"","license":"","footnotes":""},"categories":[42],"tags":[17,8,9,13,44,39,43],"class_list":["post-382","post","type-post","status-publish","format-standard","hentry","category-42","tag-bfs","tag-dp","tag-9","tag-13","tag-44","tag-39","tag-43"],"_links":{"self":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/382","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/comments?post=382"}],"version-history":[{"count":2,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/382\/revisions"}],"predecessor-version":[{"id":386,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/382\/revisions\/386"}],"wp:attachment":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/media?parent=382"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/categories?post=382"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/tags?post=382"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}1.\u5bc6\u5bc6\u6446\u653e \u5165\u95e8<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n \tcout << (200 * 250 * 240) \/ (30 * 40 * 50) << endl;\r\n return ;\r\n}<\/pre>\n2.\u8109\u51b2\u5f3a\u5ea6\u4e4b\u548c \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n1.\u53ef\u7531\u8fde\u7eed 10 \u4e2a\u6b63\u6574\u6570\u4e4b\u548c\u7ec4\u6210\uff1a\u5373\u5b58\u5728\u4e00\u4e2a\u6b63\u6574\u6570 k\uff0c\u4f7f\u5f97\u8109\u51b2\u5f3a\u5ea6 p=k+(k+1)+(k+2)+\u22ef+(k+9)\u3002
\n2.\u5404\u4e2a\u6570\u4f4d\u4e0a\u7684\u6570\u5b57\u90fd\u76f8\u540c\uff1a\u4f8b\u5982 1111\u300122222\u3001333333 \u7b49\u3002
\n3.\u6570\u503c\u4e0d\u8d85\u8fc7 20255202\uff1a\u5373 1\u2264p\u226420255202\u3002
\n\u901a\u8fc7\u8ba1\u7b97\u6240\u6709\u7b26\u5408\u6761\u4ef6\u7684\u8109\u51b2\u5f3a\u5ea6\u4e4b\u548c\uff0c\u5c0f\u84dd\u80fd\u591f\u4f18\u5316\u8bbe\u5907\u8fd0\u884c\u6a21\u5f0f\u3002\u5bf9\u6b64\uff0c\u8bf7\u5e2e\u52a9\u4ed6\u8ba1\u7b97\u8fd9\u4e00\u603b\u548c\u3002<\/li>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n \tint n = 20255202;\r\n \tint ans = 0;\r\n for (int i = 1 ; i <= n ; i = i * 10 + 1 )\r\n {\r\n for (int j = 1 ; j * i <= n && j < 10 ; j ++ )\r\n {\r\n if (i * j <= 45) continue;\r\n int num = i * j; \r\n if (!((num - 45) % 10))\r\n ans += num;\r\n }\r\n }\r\n \r\n cout << ans << endl;\r\n return ;\r\n}<\/pre>\n3.25\u4e4b\u548c \u5165\u95e8<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\u793a\u4f8b<\/h2>\n
\n
\n\u5bf9\u4e8e 40% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u2264100\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226410000\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n \tint n;\r\n \tcin >> n;\r\n \tint ans = 0;\r\n \tfor (int i = n ; i < n + 25 ; i ++ ) ans += i;\r\n \tcout << ans << endl;\r\n return ;\r\n}<\/pre>\n4.\u65d7\u5e1c \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n![\"\"](\"https:\/\/m.qzcy2.top\/wp-content\/uploads\/2025\/05\/1747197285-75f0a403-a8df-494a-a014-500eb7a32108.png\")
\n\u56fe\u5f62\u7684\u89c4\u5f8b\u662f\uff1a\u7b2c\u4e00\u884c\u7528 LANQIAO \u91cd\u590d\u586b\u5165\uff0c\u7b2c\u4e8c\u884c\u5f00\u59cb\uff0c\u6bcf\u884c\u5411\u5de6\u79fb\u52a8\u4e00\u4e2a\u5b57\u7b26\uff0c\u7528 LANQIAO \u91cd\u590d\u586b\u5165\u3002
\n\u5c0f\u84dd\u9700\u8981\u628a\u56fe\u5f62\u4e2d\u7684\u6bcf\u4e2a\u5b57\u6bcd\u90fd\u526a\u51fa\u6765\uff0c\u4ee5\u7c98\u8d34\u5230\u65d7\u5e1c\u4e0a\uff0c\u4ed6\u60f3\u77e5\u9053\uff0c\u7ed9\u5b9a\u56fe\u5f62\u7684\u9ad8\u548c\u5bbd\uff0c\u56fe\u5f62\u4e2d\u6709\u591a\u5c11\u4e2a A\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n\u5bf9\u4e8e 30% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0ch=1\uff0c1\u2264w\u226420\uff1b
\n\u5bf9\u4e8e 60% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264h,w\u226420\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264h,w\u2264100\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
const int N = 110;\r\nint g[N][N];\r\nint dx[] = {1 , 0 , -1 , 0} , dy[] = {0 , -1 , 0 , 1};\r\nbool flag[N][N];\r\nint n , m;\r\n\r\nvoid bfs(int x , int y)\r\n{\r\n queue<PII> q;\r\n q.push({x , y});\r\n flag[x][y] = true;\r\n g[x][y] = 1;\r\n \r\n while (q.size())\r\n {\r\n auto t = q.front();\r\n q.pop();\r\n \r\n x = t.first , y = t.second;\r\n \r\n for (int i = 0 ; i < 4 ; i ++ )\r\n {\r\n int xx = x + dx[i] , yy = y + dy[i];\r\n if (xx < 1 || yy < 1 || xx > n || yy > m) continue;\r\n if (g[xx][yy] || flag[xx][yy]) continue;\r\n \r\n flag[xx][yy] = true;\r\n \r\n g[xx][yy] = (g[x][y] + 1) % 8;\r\n if (!g[xx][yy]) g[xx][yy] = 1;\r\n q.push({xx , yy});\r\n }\r\n }\r\n} \r\n\r\nvoid solve()\r\n{\r\n cin >> n >> m;\r\n \t\r\n bfs(1 , 1); \t\r\n \r\n int ans = 0; \t\r\n for (int i = 1 ; i <= n ; i ++ )\r\n for (int j = 1 ; j <= m ; j ++ )\r\n if (g[i][j] == 2 || g[i][j] == 6) ans ++;\r\n \r\n cout << ans << endl;\r\n return ;\r\n}<\/pre>\n5.\u6d88\u6d88\u4e50 \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\u793a\u4f8b<\/h2>\n
\n
\n\u5bf9\u4e8e10%\u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226420\uff1b
\n\u5bf9\u4e8e20%\u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u2264100\uff1b
\n\u5bf9\u4e8e50%\u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226410000\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226410\u2076\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n string s;\r\n cin >> s;\r\n int l = 0 , r = s.size() - 1;\r\n \r\n int nums = 0;\r\n while(l < r)\r\n {\r\n \tif (s[l] == 'A')\r\n \t{\r\n \t\tif (s[r] == 'B')\r\n \t\t{\r\n \t\t\tnums += 2;\r\n \t\t\tl ++ , r --;\r\n continue;\r\n }\r\n else \r\n {\r\n r --;\r\n continue;\r\n }\r\n }\r\n else l ++;\r\n }\r\n \r\n cout << s.size() - nums << endl;\r\n return ;\r\n}<\/pre>\n6.\u6570\u5217\u5dee\u5206 \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u5305\u542b\u4e00\u4e2a\u6b63\u6574\u6570n\uff1b
\n\u7b2c\u4e8c\u884c\u5305\u542bn\u4e2a\u6574\u6570a\u2081\uff0ca\u2082\uff0c\u2026\uff0ca\u2099\uff0c\u76f8\u90bb\u6574\u6570\u4e4b\u95f4\u4f7f\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694\u3002
\n\u7b2c\u4e09\u884c\u5305\u542bn\u4e2a\u6574\u6570b\u2081\uff0cb\u2082\uff0c\u2026\uff0cb\u2099\uff0c\u76f8\u90bb\u6574\u6570\u4e4b\u95f4\u4f7f\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694\u3002<\/li>\n
\n\u8f93\u51fa\u4e00\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570\u8868\u793a\u7b54\u6848\u3002<\/li>\n<\/ul>\n\u793a\u4f8b<\/h2>\n
\n
\n4
\n22 31 12 14
\n3 19 27 44<\/li>\n
\n\u5bf9\u4e8e30%\u7684\u8bc4\u6d4b\u7528\u4f8b\uff0cn\u226410\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226410\u2075\uff0c-10\u2079\u2264a\u1d62\u226410\u2079\uff0c-10\u2079\u2264b\u1d62\u226410\u2079\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\n\u4e14\u53ef\u4ee5\u4efb\u610f\u7684\u6392\u5217b\uff0c\u4e5f\u5c31\u662f\u53ef\u4ee5\u4efb\u610f\u7684\u6392\u5217a\u3001b\u3002
\n\u90a3\u4e48\u5c31\u662f\u5c3d\u53ef\u80fd\u7684\u4f7f\u5f97\u5927\u7684a\u6d88\u53bb\u5c0f\u7684b\uff0c\u5c06a\u3001b\u6309\u7167\u4ece\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u6392\u5217\uff0c\u4f9d\u6b21\u5bf9\u7167a\u3001b\u5373\u53ef(\u56e0\u4e3a\u5982\u679cai > bi \u5219 ai \u4e00\u5b9a\u5927\u4e8eb.front ~ bi)\u3002
\n\u65f6\u95f4\u590d\u6742\u5ea6\uff1aO(nlogn)\u3002<\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n int n;\r\n cin >> n;\r\n vector<int> a(n + 1) , b(n + 1);\r\n for (int i = 1 ; i <= n ; i ++ ) cin >> a[i];\r\n for (int i = 1 ; i <= n ; i ++ ) cin >> b[i];\r\n \r\n sort(all(a)) , sort(all(b));\r\n\r\n int index = 1;\r\n for (int i = 1 ; i <= n ; i ++ )\r\n if (a[i] > b[index]) index ++;\r\n\r\n cout << n - index + 1 << endl;\r\n return ;\r\n}<\/pre>\n7.\u4e66\u4e0a\u5bfb\u5b9d \u666e\u53ca\/\u63d0\u9ad8-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\u793a\u4f8b<\/h2>\n
\n
\n8 2
\n6 3 3 1 5 4 3 4
\n1 2
\n2 3
\n2 4
\n4 5
\n5 6
\n6 7
\n7 8<\/li>\n
\n\u8d700\u6b65\u80fd\u5230\u7684\u7ed3\u70b9\uff1a1\uff1b
\n\u8d701\u6b65\u80fd\u5230\u7684\u7ed3\u70b9\uff1a2\uff0c3\uff0c4\uff1b
\n\u8d702\u6b65\u80fd\u5230\u7684\u7ed3\u70b9\uff1a3\uff0c4\uff0c5\uff0c6\uff1b
\n\u56e0\u6b64\u80fd\u5230\u7684\u7ed3\u70b9\u4e3a\uff1a1\uff0c2\uff0c3\uff0c4\uff0c5\uff0c6\u3002
\n\u80fd\u83b7\u5f97\u7684\u603b\u4ef7\u503c\u4e3a22\u3002<\/li>\n
\n\u5bf9\u4e8e20%\u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n\u226415\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c0\u2264k<n\u226410\u2075\uff0c1\u2264w\u1d62\u226410\u2076\uff0c1\u2264u\u1d62\uff0cv\u1d62\u2264n\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\n\u90a3\u4e48\u5c31\u5f88\u7b80\u5355\u4e86\uff0c\u904d\u5386\u4e00\u904d\u56fe\uff0c\u6807\u8bb0\u6240\u6709\u80fd\u8d70\u5230\u7684\u70b9\u6700\u540e\u7d2f\u52a0\u5373\u53ef\u3002<\/span>
\n\u901a\u8fc7list\u6807\u8bb0k\u6b65\u5185\u80fd\u8d70\u5230\u7684\u7ed3\u70b9\uff0cflag\u6807\u8bb0\u76ee\u524d\u8bbf\u95ee\u8fc7\u7684\u7ed3\u70b9\u3002\u65f6\u95f4\u590d\u6742\u5ea6O(n)\u3002\u00a0<\/span><\/span><\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
const int N = 2e5 + 10;\r\n\r\nint e[N] , ne[N] , idx , h[N];\r\nint w[N] , n , k;\r\nbool flag[N] , list[N];\r\n\r\nvoid add(int a , int b)\r\n{\r\n e[idx] = b , ne[idx] = h[a] , h[a] = idx ++;\r\n}\r\n\r\nvoid bfs(int s)\r\n{\r\n queue<PII> q;\r\n q.push({0 , s});\r\n flag[s] = true;\r\n list[s] = true;\r\n\r\n while (q.size())\r\n {\r\n auto t = q.front();\r\n q.pop();\r\n\r\n int deth = t.first , index = t.second;\r\n\r\n if (deth >= k * 2) continue;\r\n\r\n for (int i = h[index] ; ~i ; i = ne[i])\r\n {\r\n int j = e[i];\r\n\r\n if (!flag[j])\r\n {\r\n list[j] = true;\r\n flag[j] = true;\r\n q.push({deth + 1 , j});\r\n }\r\n }\r\n }\r\n}\r\n\r\nvoid solve()\r\n{\r\n memset(h , -1 , sizeof h);\r\n cin >> n >> k;\r\n for (int i = 1 ; i <= n ; i ++ ) cin >> w[i];\r\n\r\n for (int i = 1 ; i < n ; i ++ ) \r\n {\r\n int a , b;\r\n cin >> a >> b;\r\n add(a , b);\r\n add(b , a);\r\n }\r\n\r\n bfs(1);\r\n\r\n int ans = 0;\r\n for (int i = 1 ; i <= n ; i ++ ) \r\n if (list[i]) ans += w[i];\r\n \r\n cout << ans << endl;\r\n return ;\r\n}<\/pre>\n8.\u7ffb\u8f6c\u786c\u5e01<\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6b63\u6574\u6570 n,m\uff0c\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694\u3002
\n\u63a5\u4e0b\u6765 n \u884c\uff0c\u6bcf\u884c\u5305\u542b m \u4e2a 0 \u6216 1\uff0c\u8868\u793a\u7ed9\u5b9a\u7684 n\u00d7m \u4e2a\u786c\u5e01\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n4 4
\n1010
\n1111
\n1011
\n1100<\/li>\n
\n\u5982\u56fe\uff0c\u5b9e\u7ebf\u8868\u793a\u6b63\u9762\uff0c\u865a\u7ebf\u8868\u793a\u53cd\u9762\uff0c\u7ffb\u8f6c\u6700\u540e\u4e00\u884c\u53ef\u4ee5\u5f97\u5230\u6700\u5927\u4ef7\u503c\u548c\uff1a![\"\"](\"https:\/\/m.qzcy2.top\/wp-content\/uploads\/2025\/05\/1747198817-ba32456c-3f14-4f03-abde-37c66d453820-300x135.png\")
<\/li>\n
\n\u5bf9\u4e8e 40% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0cn,m\u226420\uff1b
\n\u5bf9\u4e8e\u6240\u6709\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264n,m\u22641000\u3002<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"