\u96be\u5ea6<\/strong>\u8bc4\u7ea7\u53c2\u7167\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":[44,43],"class_list":["post-340","post","type-post","status-publish","format-standard","hentry","category-42","tag-44","tag-43"],"_links":{"self":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/340","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=340"}],"version-history":[{"count":25,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/340\/revisions"}],"predecessor-version":[{"id":350,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/posts\/340\/revisions\/350"}],"wp:attachment":[{"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/media?parent=340"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/categories?post=340"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/m.qzcy2.top\/index.php\/wp-json\/wp\/v2\/tags?post=340"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}1.\u79fb\u52a8\u8ddd\u79bb \u666e\u53ca\/\u63d0\u9ad8-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n2.\u6cbf\u7740\u4e00\u4e2a\u5706\u5fc3\u5728\u539f\u70b9 (0,0)\u3001\u4ee5\u4ed6\u5f53\u524d\u4f4d\u7f6e\u5230\u539f\u70b9\u7684\u8ddd\u79bb\u4e3a\u534a\u5f84\u7684\u5706\u7684\u5706\u5468\u79fb\u52a8\uff0c\u79fb\u52a8\u65b9\u5411\u4e0d\u9650\uff08\u5373\u987a\u65f6\u9488\u6216\u9006\u65f6\u9488\u79fb\u52a8\u4e0d\u9650\uff09\u3002
\n\u5728\u8fd9\u79cd\u6761\u4ef6\u4e0b\uff0c\u4ed6\u5230\u8fbe\u76ee\u7684\u5730\u6700\u5c11\u79fb\u52a8\u591a\u5c11\u5355\u4f4d\u8ddd\u79bb\uff1f\u4f60\u53ea\u9700\u8981\u8f93\u51fa\u7b54\u6848\u56db\u820d\u4e94\u5165\u5230\u6574\u6570\u7684\u7ed3\u679c\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\u601d\u8def<\/h2>\n
\n
\n\u8ba1\u7b97\u8fc7\u7a0b\u6d89\u53ca\u5230\u9ad8\u6570\u7684\u77e5\u8bc6\uff0c\u53ef\u4ee5\u76f4\u63a5\u4f7f\u7528cpp\u81ea\u5e26\u7684\u5e93\u51fd\u6570\u89e3\u51b3\u3002\u65f6\u95f4\u590d\u6742\u5ea6O(1).<\/span><\/span><\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
void solve()\r\n{ \r\n double r = sqrt(233 * 233 + 666 * 666);\r\n int ans = r + asin(666.0 \/ r) * r;\r\n cout << ans << endl;\r\n return ;\r\n}<\/pre>\n2.\u5ba2\u6d41\u91cf\u4e0a\u9650 \u666e\u53ca+\/\u63d0\u9ad8<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n2. \u5bf9\u4e8e\u4efb\u610f\u5206\u5e97 i \u548c j\uff081 \u2264 i, j \u2264 2025\uff0ci \u53ef\u7b49\u4e8e j\uff09\uff0c\u5b83\u4eec\u7684\u5ba2\u6d41\u91cf\u4e0a\u9650 A_i \u548c A_j \u7684\u4e58\u79ef\u4e0d\u5f97\u8d85\u8fc7 i \u00d7 j + 2025\u3002\u8fd9\u4e9b\u7ea6\u675f\u65e8\u5728\u5e73\u8861\u5404\u5206\u5e97\u5ba2\u6d41\u538b\u529b\uff0c\u786e\u4fdd\u670d\u52a1\u8d28\u91cf\u548c\u8fd0\u8425\u7a33\u5b9a\u6027\u3002\u73b0\u5728\uff0c\u8bf7\u4f60\u8ba1\u7b97\u8fd9\u6837\u7684\u5206\u914d\u65b9\u6848\u7a76\u7adf\u6709\u591a\u5c11\u79cd\u3002\u7531\u4e8e\u7b54\u6848\u53ef\u80fd\u5f88\u5927\uff0c\u4f60\u53ea\u9700\u8f93\u51fa\u5176\u5bf9 10^9 + 7 \u53d6\u4f59\u540e\u7684\u7ed3\u679c\u5373\u53ef\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\u601d\u8def<\/h2>\n
\n
\n\u518d\u4ece1\u5f00\u59cb\u679a\u4e3e\u4e00\u4e9b\u6570\u636e\uff0cA1={1 \uff0c2} \u3001A2={1\uff0c2\uff0c3}\u3001A3{1\uff0c2\uff0c3\uff0c4} ... A1013={1\uff0c2\uff0c3\uff0c...\uff0c1013}\uff0c\u90a3\u4e48\u6700\u540e\u7684\u4e2a\u6570\u4e00\u5b9a\u662f2^1012 % mod \u3002<\/span><\/span><\/span><\/span><\/span><\/li>\n\u4ee3\u7801<\/h2>\n
const int mod = 1e9 + 7;\r\n\r\ninline int qmi(int a , int n)\r\n{\r\n int res = 1;\r\n while (n)\r\n {\r\n if (n & 1) res = a * res % mod;\r\n a = a * a % mod;\r\n n >>= 1;\r\n }\r\n\r\n return res;\r\n}\r\n\r\nvoid solve()\r\n{ \r\n cout << qmi(2 , 1012) << endl;\r\n return ;\r\n}<\/pre>\n3.\u53ef\u5206\u89e3\u7684\u6b63\u6574\u6570 \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n2. \u5e8f\u5217\u4e2d\u7684\u6570\u5b57\u662f\u8fde\u7eed\u9012\u589e\u7684\u6574\u6570\uff08\u5373\u76f8\u90bb\u5143\u7d20\u4e4b\u5dee\u4e3a 1\uff09\uff0c\u53ef\u4ee5\u5305\u62ec\u6b63\u6574\u6570\u3001\u8d1f\u6574\u6570\u6216 0\u3002\u4f8b\u5982\uff1a
\n- [1,2,3]\u3001[4,5,6,7] \u548c [\u22121,0,1] \u662f\u7b26\u5408\u6761\u4ef6\u7684\u5e8f\u5217\u3002
\n- [1,2]\uff08\u957f\u5ea6\u4e0d\u8db3\uff09\u548c [1,2,4]\uff08\u4e0d\u8fde\u7eed\uff09\u4e0d\u7b26\u5408\u8981\u6c42\u3002\u73b0\u7ed9\u5b9a\u4e00\u7ec4\u5305\u542b N \u4e2a\u6b63\u6574\u6570\u7684\u6570\u636e A_1, A_2, ..., A_N\u3002\u5982\u679c\u67d0\u4e2a A_i \u80fd\u591f\u8868\u793a\u4e3a\u7b26\u5408\u4e0a\u8ff0\u6761\u4ef6\u7684\u8fde\u7eed\u6574\u6570\u5e8f\u5217\u4e2d\u6240\u6709\u5143\u7d20\u7684\u548c\uff0c\u5219\u79f0 A_i \u662f\u53ef\u5206\u89e3\u7684\u3002\u8bf7\u4f60\u7edf\u8ba1\u8fd9\u7ec4\u6570\u636e\u4e2d\u53ef\u5206\u89e3\u7684\u6b63\u6574\u6570\u7684\u6570\u91cf\u3002<\/li>\n
\n\u7b2c\u4e8c\u884c\u5305\u542b N \u4e2a\u6b63\u6574\u6570 A_1, A_2, ..., A_N\uff0c\u8868\u793a\u9700\u8981\u5224\u65ad\u662f\u5426\u53ef\u5206\u89e3\u7684\u6b63\u6574\u6570\u5e8f\u5217\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n3
\n3 6 15<\/li>\n
\n3<\/li>\n
\n- A_i = 3 \u662f\u53ef\u5206\u89e3\u7684\uff0c\u56e0\u4e3a [0,1,2] \u7684\u548c\u4e3a 0+1+2=3\u3002
\n- A_i = 6 \u662f\u53ef\u5206\u89e3\u7684\uff0c\u56e0\u4e3a [1,2,3] \u7684\u548c\u4e3a 1+2+3=6\u3002
\n- A_i = 15 \u662f\u53ef\u5206\u89e3\u7684\uff0c\u56e0\u4e3a [4,5,6] \u7684\u548c\u4e3a 4+5+6=15\u3002
\n\u6240\u4ee5\u53ef\u5206\u89e3\u7684\u6b63\u6574\u6570\u7684\u6570\u91cf\u4e3a 3\u3002<\/li>\n
\n- \u5bf9\u4e8e 30% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1 \u2264 N \u2264 100\uff0c1 \u2264 A_i \u2264 100\u3002
\n- \u5bf9\u4e8e 100% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1 \u2264 N \u2264 10^5\uff0c1 \u2264 A_i \u2264 10^9\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{ \r\n int n;\r\n cin >> n;\r\n vector<int> a(n + 1);\r\n for (int i = 1 ; i <= n ; i ++ ) cin >> a[i];\r\n\r\n int ans = 0;\r\n for (int i = 1 ; i <= n ; i ++ ) if (a[i] != 1) ans ++;\r\n\r\n cout << ans << endl;\r\n return ;\r\n}<\/pre>\n4.\u4ea7\u503c\u8c03\u6574 \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n- \u94f6\u77ff\u65b0\u4ea7\u503c\uff1aB' = \u230a(A + C) \/ 2\u230b
\n- \u94dc\u77ff\u65b0\u4ea7\u503c\uff1aC' = \u230a(A + B) \/ 2\u230b\u5176\u4e2d\uff0c\u230a\u230b \u8868\u793a\u5411\u4e0b\u53d6\u6574\u3002\u4f8b\u5982\uff0c\u230a3.7\u230b = 3\uff0c\u230a5.2\u230b = 5\u3002\u8ba1\u7b97\u51fa A'\u3001B'\u3001C' \u540e\uff0c\u540c\u65f6\u66f4\u65b0\uff1aA \u53d8\u4e3a A'\uff0cB \u53d8\u4e3a B'\uff0cC \u53d8\u4e3a C'\uff0c\u4f5c\u4e3a\u4e0b\u4e00\u5e74\u8c03\u6574\u7684\u57fa\u7840\u3002\u4e09\u5144\u5f1f\u8ba4\u4e3a\u8fd9\u4e2a\u65b9\u6cd5\u80fd\u5e73\u8861\u4ea7\u503c\u6ce2\u52a8\uff0c\u4e8e\u662f\u8ba1\u5212\u8fde\u7eed\u6267\u884c K \u6b21\u8c03\u6574\u3002\u73b0\u5728\uff0c\u8bf7\u4f60\u5e2e\u4ed6\u4eec\u8ba1\u7b97\uff0c\u7ecf\u8fc7 K \u6b21\u8c03\u6574\u540e\uff0c\u91d1\u77ff\u3001\u94f6\u77ff\u548c\u94dc\u77ff\u7684\u4ea7\u503c\u5206\u522b\u662f\u591a\u5c11\u3002<\/li>\n
\n\u63a5\u4e0b\u6765\u7684 T \u884c\uff0c\u6bcf\u884c\u5305\u542b\u56db\u4e2a\u6574\u6570 A, B, C, K\uff0c\u5206\u522b\u8868\u793a\u91d1\u77ff\u3001\u94f6\u77ff\u548c\u94dc\u77ff\u7684\u521d\u59cb\u4ea7\u503c\uff0c\u4ee5\u53ca\u9700\u8981\u6267\u884c\u7684\u8c03\u6574\u6b21\u6570\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n2
\n10 20 30 1
\n5 5 5 3<\/li>\n
\n25 20 15
\n5 5 5<\/li>\n
\n\u8bc4\u6d4b\u7528\u4f8b\u89c4\u6a21\u4e0e\u7ea6\u5b9a\uff1a
\n- \u5bf9\u4e8e 30% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1 \u2264 T \u2264 100\uff0c1 \u2264 A, B, C, K \u2264 10^5\u3002
\n- \u5bf9\u4e8e 100% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1 \u2264 T \u2264 10^5\uff0c1 \u2264 A, B, C, K \u2264 10^9\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4ee3\u7801<\/h2>\n
void solve()\r\n{ \r\n int a , b , c , k;\r\n cin >> a >> b >> c >> k;\r\n while (k -- )\r\n {\r\n int aa = (b + c) >> 1;\r\n int bb = (a + c) >> 1;\r\n int cc = (a + b) >> 1;\r\n\r\n a = aa , b = bb , c = cc;\r\n if (a == b && b == c) break;\r\n }\r\n\r\n cout << a << \" \" << b << \" \" << c << endl;\r\n return ;\r\n}\r\n\r\nsigned main() \r\n{\r\n ios::sync_with_stdio(false);\r\n cin.tie(nullptr), cout.tie(nullptr);\r\n int T = 1;\r\n cin >> T;\r\n while (T -- ) solve();\r\n return 0;\r\n}<\/pre>\n5.\u753b\u5c55\u5e03\u7f6e \u666e\u53ca-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n\u4e3a\u4e86\u4f18\u5316\u5e03\u7f6e\uff0c\u4ed6\u4eec\u67e5\u9605\u4e86\u300a\u753b\u5c55\u5e03\u7f6e\u6307\u5357\u300b\u3002\u6307\u5357\u6307\u51fa\uff0c\u7406\u60f3\u7684\u753b\u5c55\u5e94\u4f7f\u89c2\u4f17\u5728\u6b23\u8d4f\u753b\u4f5c\u65f6\uff0c\u827a\u672f\u4ef7\u503c\u7684\u8fc7\u6e21\u5c3d\u91cf\u5e73\u7f13\u3002\u6307\u5357\u5efa\u8bae\uff0c\u9009\u62e9\u5e76\u6392\u5217 M \u5e45\u753b\uff0c\u5e94\u4f7f\u827a\u672f\u4ef7\u503c\u7684\u53d8\u5316\u7a0b\u5ea6\u901a\u8fc7\u4e00\u4e2a\u6570\u503c L \u6765\u8861\u91cf\uff0c\u4e14\u8be5\u503c\u8d8a\u5c0f\u8d8a\u597d\u3002\u6570\u503c L \u7684\u5b9a\u4e49\u4e3a\uff1a
\nL = \u03a3(i=1\u5230M-1) |B(i+1)^2 - B(i)^2|
\n\u5176\u4e2d B(i) \u8868\u793a\u5c55\u5385\u7b2c i \u4e2a\u4f4d\u7f6e\u4e0a\u753b\u4f5c\u7684\u827a\u672f\u4ef7\u503c\u3002
\n\u73b0\u5728\uff0c\u4ed6\u4eec\u5e0c\u671b\u901a\u8fc7\u7cbe\u5fc3\u6311\u9009\u548c\u6392\u5217\u8fd9 M \u5e45\u753b\u4f5c\uff0c\u4f7f L \u8fbe\u5230\u6700\u5c0f\u503c\uff0c\u4ee5\u63d0\u5347\u753b\u5c55\u7684\u6574\u4f53\u534f\u8c03\u6027\u3002\u8bf7\u4f60\u5e2e\u4ed6\u4eec\u8ba1\u7b97\u51fa\u8fd9\u4e2a\u6700\u5c0f\u503c\u662f\u591a\u5c11\u3002<\/li>\n
\n\u8f93\u5165\u5171\u4e24\u884c\u3002
\n\u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6b63\u6574\u6570 N \u548c M\uff0c\u5206\u522b\u8868\u793a\u753b\u4f5c\u7684\u603b\u6570\u548c\u9700\u8981\u6311\u9009\u7684\u753b\u4f5c\u6570\u91cf\u3002
\n\u7b2c\u4e8c\u884c\u5305\u542b N \u4e2a\u6b63\u6574\u6570 A1,A2,\u2026,AN\uff0c\u8868\u793a\u6bcf\u5e45\u753b\u4f5c\u7684\u827a\u672f\u4ef7\u503c\u3002<\/li>\n
\n\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a L \u7684\u6700\u5c0f\u503c\u3002<\/li>\n<\/ul>\n\u793a\u4f8b<\/h2>\n
\n
\n4 2
\n1 5 2 4<\/li>\n
\n3<\/li>\n
\n\u8bc4\u6d4b\u7528\u4f8b\u89c4\u6a21\u4e0e\u7ea6\u5b9a
\n\u5bf9\u4e8e 40% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c2\u2264M\u2264N\u226410^3\uff0c1\u2264Ai\u226410^3\u3002
\n\u5bf9\u4e8e 100% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c2\u2264M\u2264N\u226410^5\uff0c1\u2264Ai\u226410^5\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\u4f46\u662f\u65f6\u95f4\u4e0d\u5141\u8bb8<\/del> \u3002\u628a|Ai+1\u00b2 - Ai\u00b2|\u62c6\u5f00\uff0c\u53ef\u4ee5\u53d1\u73b0\uff0c\u5982\u679c\u6309\u7167\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u7684\u8bdd\uff0cAi+1 \u59cb\u7ec8\u5927\u4e8eAi\u3002\u6240\u4ee5\u53ef\u4ee5\u53bb\u6389\u7edd\u5bf9\u503c\uff0c\u5c06\u76f8\u53cd\u7684\u6570\u62b5\u6d88\u4e4b\u540e\u5c31\u53ef\u4ee5\u5f97\u51fa\u6bcf\u4e00\u6b21O(m) \u90fd\u53ef\u4ee5\u53d8\u6210(Ai+m-1\u00b2 - ai\u00b2)\u3002\u5982\u6b64 \u5c31\u53ef\u4ee5\u5c06\u603b\u7684<\/span>\u65f6\u95f4\u590d\u6742\u5ea6\u4f18\u5316\u4e3aO(n).<\/span><\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
void solve()\r\n{ \r\n int n , m;\r\n cin >> n >> m;\r\n vector<int> a(n + 1);\r\n for (int i = 1 ; i <= n ; i ++ ) cin >> a[i];\r\n sort(all(a));\r\n\r\n int ans = INF;\r\n for (int i = 1 ; i + m - 1 <= n ; i ++ )\r\n {\r\n ans = min(ans , a[i + m - 1] * a[i + m - 1] - a[i] * a[i]);\r\n }\r\n\r\n cout << ans << endl;\r\n\r\n return ;\r\n}<\/pre>\n6.\u6c34\u8d28\u68c0\u6d4b \u666e\u53ca\/\u63d0\u9ad8-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n\u8f93\u5165\u5171\u4e24\u884c\uff0c\u8868\u793a\u4e00\u4e2a 2\u00d7n \u7684\u6cb3\u5e8a\u3002
\n\u6bcf\u884c\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u7684\u5b57\u7b26\u4e32\uff0c\u4ec5\u5305\u542b '#'\u00a0 \u548c '.' \uff0c\u5176\u4e2d '#' \u8868\u793a\u5df2\u7ecf\u5b58\u5728\u7684\u68c0\u6d4b\u5668\uff0c'.'\u00a0 \u8868\u793a\u7a7a\u767d\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n.##. . ...#
\n.#.#.#.. .<\/li>\n
\n\u5176\u4e2d\u4e00\u79cd\u65b9\u6848\uff1a
\n.### .\u00a0 . . . #
\n.#. ######
\n\u589e\u52a0\u4e86 5 \u4e2a\u68c0\u6d4b\u5668\u3002<\/li>\n\u601d\u8def<\/h2>\n
\n
\n1.a[i] == '#' && b[i] == '#' \u6b64\u65f6\u5176\u548c\u4efb\u610f\u4e00\u4e2a\u8fde\u901a\u5757\u7684\u8ddd\u79bb\u90fd\u662f\u76f8\u540c\u7684\u3002\u4e3aindex - i - 1.<\/span>
\n2.a[i] == '#' && b[i] == '.' \u6b64\u65f6\u82e5a[i+index] == '#' \u5219\u8ddd\u79bb\u4e3a index - i - 1.<\/span>
\n3.a[i] == '.' && b[i] == '#' \u6b64\u65f6\u82e5b[i+index] == '#' \u5219\u8ddd\u79bb\u4e3aindex - i - 1.<\/span>
\n\u518d\u8fdb\u884c\u4e00\u4e9b\u7279\u5224\u4f18\u5316\uff0c\u6700\u540e\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(n)\u3002\u00a0<\/span><\/span><\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
void solve()\r\n{\r\n string a , b;\r\n cin >> a >> b;\r\n int n = a.size();\r\n a = \" \" + a , b = \" \" + b;\r\n\r\n int ans = 0;\r\n\r\n for (int i = 1 ; i <= n ; i ++ )\r\n {\r\n if (a[i] == '#' && b[i] == '#')\r\n {\r\n if (a[i + 1] == '#' || b[i + 1] == '#') continue;\r\n\r\n for (int j = i + 1 ; j <= n ; j ++ ) \r\n {\r\n if ((a[j] == '.' && b[j] == '#')\r\n || (a[j] == '#' && b[j] == '.')\r\n || (a[j] == '#' && b[j] == '#'))\r\n {\r\n ans += j - i - 1;\r\n i = j - 1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n if (a[i] == '#' && b[i] == '.')\r\n {\r\n if (a[i + 1] == '#') continue;\r\n\r\n for (int j = i + 1 ; j <= n ; j ++ )\r\n {\r\n if ((a[j] == '#' && b[j] == '.')\r\n || (a[j] == '#' && b[j] == '#'))\r\n {\r\n ans += j - i - 1;\r\n i = j - 1;\r\n break;\r\n }\r\n\r\n if (a[j] == '.' && b[j] == '#')\r\n {\r\n ans += j - i;\r\n i = j - 1;\r\n a[j] = b[j] = '#';\r\n break;\r\n }\r\n }\r\n }\r\n\r\n if (a[i] == '.' && b[i] == '#')\r\n {\r\n if (b[i + 1] == '#') continue;\r\n\r\n for (int j = i + 1 ; j <= n ; j ++ ) \r\n {\r\n if ((a[j] == '.' && b[j] == '#')\r\n || (a[j] == '#' && b[j] == '#'))\r\n {\r\n ans += j - i - 1;\r\n i = j - 1;\r\n break;\r\n }\r\n\r\n if (a[j] == '#' && b[j] == '.')\r\n {\r\n ans += j - i;\r\n i = j - 1;\r\n a[j] = b[j] = '#';\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n cout << ans << endl;\r\n}<\/pre>\n7.\u751f\u4ea7\u8f66\u95f4 \u666e\u53ca+\/\u63d0\u9ad8<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\u793a\u4f8b<\/h2>\n
\n
\n9
\n9 7 3 7 1 6 2 2 7
\n1 2
\n1 3
\n2 4
\n2 5
\n2 6
\n6 7
\n6 8
\n6 9<\/li>\n
\n\u5bf9\u4e8e 20% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c2\u2264n\u2264100\u3002
\n\u5bf9\u4e8e 100% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c2\u2264n\u22641000\uff0c1\u2264wi \u22641000\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\n
\n\u5982\u4e0b\u56fe\uff0c\u6bcf\u4e2a\u5b50\u8282\u70b9\u90fd\u53ef\u4ee5\u63d0\u4f9b\u81ea\u8eab\u7684\u4ef7\u503c\u6216\u662f0.<\/span>
\n![\"\"](\"https:\/\/cdn.luogu.com.cn\/upload\/image_hosting\/c53h0fuq.png?x-oss-process=image\/resize,m_lfit,h_1000,w_450\")
\n\u5219\u5bf9\u4e8e\u6bcf\u4e2a\u8282\u70b9 u \u53ca\u5176\u5b50\u8282\u70b9 v \u2208 children[u]\uff0c\u72b6\u6001\u8f6c\u79fb\u65b9\u7a0b\u4e3a\uff1adp[u][s] = \u22c1_{v \u2208 children[u]} ( \u22c1_{k \u2208 a[v]} dp[u][s - k] )\u3002<\/span>
\n\u5229\u7528\u6eda\u52a8\u6570\u7ec4\u4f18\u5316\u7a7a\u95f4\u3002\u603b\u65f6\u95f4\u590d\u6742\u5ea6O(NW)\uff0c\u7a7a\u95f4\u590d\u6742\u5ea6O(N+W)\u3002<\/span><\/span><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
const int N = 1010; \r\nvector<vector<int> > g(N , vector<int>() ) , a(N , vector<int>() ); \r\nvector<int> w(N , 0); \r\n \r\nint dfs(int n, int parent = -1) \r\n{\r\n if (g[n].size() == 1 && n != 1) \r\n {\r\n a[n].push_back(w[n]);\r\n return 1;\r\n }\r\n\r\n vector<bool> dp(w[n] + 1, false);\r\n dp[0] = true;\r\n \r\n for (int v : g[n]) \r\n {\r\n if (v == parent) continue;\r\n \r\n if (!a[v].size()) dfs(v, n);\r\n \r\n vector<bool> temp = dp;\r\n for (int i = 0 ; i <= w[n] ; i ++ ) \r\n {\r\n if (dp[i]) {\r\n for (int val : a[v]) {\r\n if (i + val <= w[n]) \r\n temp[i + val] = true;\r\n }\r\n }\r\n }\r\n dp = temp;\r\n }\r\n \r\n a[n].clear();\r\n for (int i = 0 ; i <= w[n] ; i ++ )\r\n {\r\n if (dp[i]) a[n].push_back(i);\r\n }\r\n \r\n return a[n].size();\r\n} \r\n \r\nvoid solve() \r\n{\r\n int n;\r\n cin >> n;\r\n for (int i = 1 ; i <= n ; i++) \r\n cin >> w[i];\r\n\r\n for (int i = 1 ; i < n ; i++) \r\n {\r\n int u, v;\r\n cin >> u >> v;\r\n g[u].push_back(v);\r\n g[v].push_back(u);\r\n }\r\n\r\n dfs(1);\r\n\r\n int ans = 0;\r\n for (int val : a[1]) \r\n ans = max(ans , val);\r\n cout << ans << endl;\r\n}<\/pre>\n8.\u88c5\u4fee\u62a5\u4ef7 \u666e\u53ca\/\u63d0\u9ad8-<\/span><\/h1>\n
\u9898\u76ee\u63cf\u8ff0<\/h2>\n
\n
\n\u7136\u800c\uff0c\u5f53\u8001\u738b\u63d0\u4ea4\u6570\u636e\u540e\uff0c\u4ed6\u53d1\u73b0\u8fd9\u5957\u7cfb\u7edf\u7684\u8fd0\u4f5c\u65b9\u5f0f\u5e76\u4e0d\u900f\u660e\uff1a\u7cfb\u7edf\u53ea\u4f1a\u7ed9\u51fa\u4e00\u4e2a\u6700\u7ec8\u62a5\u4ef7\uff0c\u800c\u4e0d\u4f1a\u516c\u5f00\u4efb\u4f55\u8fd0\u7b97\u8fc7\u7a0b\u6216\u4e2d\u95f4\u6b65\u9aa4\u3002
\n\u516c\u53f8\u5bf9\u6b64\u89e3\u91ca\u79f0\uff0c\u8fd9\u5957\u7cfb\u7edf\u4f1a\u4f9d\u636e\u67d0\u79cd\u5185\u90e8\u7b97\u6cd5\uff0c\u5728\u6bcf\u5bf9\u76f8\u90bb\u6570\u5b57\u4e4b\u95f4\u63d2\u5165 +\uff08\u52a0\u6cd5\uff09\u3001\u2212\uff08\u51cf\u6cd5\uff09\u6216 \u2295\uff08\u5f02\u6216\uff09\u8fd0\u7b97\u7b26\uff0c\u5e76\u6309\u7167\u7279\u5b9a\u4f18\u5148\u7ea7\u89c4\u5219\u8ba1\u7b97\u7ed3\u679c\uff1a\u5f02\u6216\u8fd0\u7b97\u4f18\u5148\u7ea7\u6700\u9ad8\uff0c\u5176\u6b21\u662f\u52a0\u51cf\u3002\u4f46\u7531\u4e8e\u4fdd\u5bc6\u6027\uff0c\u5177\u4f53\u7684\u8fd0\u7b97\u7b26\u7ec4\u5408\u4ee5\u53ca\u4e2d\u95f4\u8fc7\u7a0b\u90fd\u4e0d\u4f1a\u5bf9\u5916\u516c\u5f00\u3002
\n\u4e3a\u4e86\u9a8c\u8bc1\u7cfb\u7edf\u62a5\u4ef7\u662f\u5426\u5408\u7406\uff0c\u8001\u738b\u51b3\u5b9a\u6a21\u62df\u5176\u8fd0\u4f5c\u65b9\u5f0f\uff0c\u5c1d\u8bd5\u6bcf\u79cd\u53ef\u80fd\u7684\u8fd0\u7b97\u7b26\u7ec4\u5408\uff0c\u8ba1\u7b97\u51fa\u6240\u6709\u53ef\u80fd\u51fa\u73b0\u7684\u7ed3\u679c\u7684\u603b\u548c\u3002\u5982\u679c\u6700\u7ec8\u62a5\u4ef7\u660e\u663e\u8d85\u51fa\u8fd9\u4e2a\u8303\u56f4\uff0c\u4ed6\u5c31\u6709\u7406\u7531\u6000\u7591\u7cfb\u7edf\u5b58\u5728\u5f02\u5e38\u6216\u8bef\u5dee\u3002\u53ea\u662f\u8001\u738b\u5e74\u4e8b\u5df2\u9ad8\uff0c\u624b\u52a8\u8ba1\u7b97\u9887\u4e3a\u5403\u529b\uff0c\u4fbf\u5411\u4f60\u6c42\u52a9\u3002
\n\u73b0\u5728\uff0c\u8bf7\u4f60\u5e2e\u8001\u738b\u7b97\u51fa\u6240\u6709\u53ef\u80fd\u7684\u7ed3\u679c\u7684\u603b\u548c\u3002\u7531\u4e8e\u8be5\u603b\u548c\u53ef\u80fd\u5f88\u5927\uff0c\u4f60\u53ea\u9700\u63d0\u4f9b\u5176\u5bf9 10^9 +7 \u53d6\u4f59\u540e\u7684\u7ed3\u679c\u5373\u53ef\u3002<\/li>\n
\n\u7b2c\u4e00\u884c\u8f93\u5165\u4e00\u4e2a\u6574\u6570 N\uff0c\u8868\u793a\u88c5\u4fee\u76f8\u5173\u8d39\u7528\u7684\u9879\u6570\u3002
\n\u7b2c\u4e8c\u884c\u8f93\u5165 N \u4e2a\u975e\u8d1f\u6574\u6570 A1,A2,\u2026,AN\uff0c\u8868\u793a\u5404\u9879\u8d39\u7528\u3002<\/li>\n\u793a\u4f8b<\/h2>\n
\n
\n3
\n0 2 5<\/li>\n
\n\u5bf9\u4e8e\u8f93\u5165\u6837\u4f8b\u4e2d\u7684\u4e09\u4e2a\u6570 A=[0,2,5]\uff0c\u6240\u6709\u53ef\u80fd\u7684\u8fd0\u7b97\u7b26\u7ec4\u5408\u5171\u6709 9 \u79cd\u3002\u8ba1\u7b97\u7ed3\u679c\u5982\u4e0b\uff1a
\n0\u22952\u22955=7
\n0\u22952+5=7
\n0\u22952\u22125=\u22123
\n0+2\u22955=7
\n0+2+5=7
\n0+2\u22125=\u22123
\n0\u22122\u22955=\u22127
\n0\u22122+5=3
\n0\u22122\u22125=\u22127
\n\u6240\u6709\u7ed3\u679c\u7684\u603b\u548c\u4e3a\uff1a
\n7+7+(\u22123)+7+7+(\u22123)+(\u22127)+3+(\u22127)=11
\n11 \u5bf9 10^9 +7 \u53d6\u4f59\u540e\u7684\u503c\u4f9d\u7136\u4e3a 11\uff0c\u56e0\u6b64\uff0c\u8f93\u51fa\u7ed3\u679c\u4e3a 11\u3002<\/li>\n
\n\u5bf9\u4e8e 30% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264N\u226413\uff0c0\u2264Ai\u226410^3\u3002
\n\u5bf9\u4e8e 60% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264N\u226410^3\uff0c0\u2264Ai\u226410^5\u3002
\n\u5bf9\u4e8e 100% \u7684\u8bc4\u6d4b\u7528\u4f8b\uff0c1\u2264N\u226410^5\uff0c0\u2264Ai\u226410^9\u3002<\/li>\n<\/ul>\n\u601d\u8def<\/h2>\n
\n
\n\u5f02\u6216\u8fd0\u7b97\u7684\u4f18\u5148\u7ea7\u66f4\u9ad8\uff0c\u56e0\u6b64\u5c06\u4e00\u4e32\u5f02\u6216\u8fd0\u7b97\u7684\u7ed3\u679c\u5408\u5e76\u6210\u4e00\u4e2a\u6570\u5b57\u3002\u5219\u6b64\u9898\u4e2d\u4ec5\u5269\u4e0b+\u3001-\u4e24\u79cd\u8fd0\u7b97\u3002\u89c2\u5bdf\u6837\u4f8b\uff0c\u6709\u5f88\u591a\u7c7b\u4f3c\"-xxx\" \u548c \"+xxx\" \u7684 \u53ef\u4ee5\u4e92\u76f8\u62b5\u6d88\u3002\u56e0\u6b64\u5bf9\u7b54\u6848\u4ea7\u751f\u8d21\u732e\u7684\uff0c\u53ea\u6709\u4e00\u6bb5\u524d\u7f00\u7684\u5f02\u6216\u3002\u56e0\u6b64\u679a\u4e3e\u524d\u7f00\u5f02\u6216\u7684\u957f\u5ea6 i<\/span><\/span><\/span><\/span>\uff0c\u7edf\u8ba1\u5176\u8d21\u732e\u5373\u53ef\uff0c\u5176\u8d21\u732e\u5c31\u662f\uff1a\u9996\u5148\u00a0i<\/span>+<\/span><\/span>1<\/span><\/span><\/span><\/span>\u00a0\u4f4d\u7f6e\u7684\u8fd0\u7b97\u7b26\u4e0d\u80fd\u662f\u5f02\u6216\uff08\u56e0\u4e3a\u8fd9\u6837\u4e00\u6765\u524d\u7f00\u5f02\u6216\u7684\u957f\u5ea6\u5c31\u4e0d\u662f\u00a0i<\/span><\/span><\/span><\/span>\u00a0\u800c\u81f3\u5c11\u662f\u00a0i<\/span>+<\/span><\/span>1<\/span><\/span><\/span><\/span>\u00a0\u4e86\uff09\uff0c\u63a5\u7740\u00a0i<\/span>+<\/span><\/span>2<\/span><\/span><\/span><\/span>\u00a0\u5305\u62ec\u540e\u9762\u7684\u8fd0\u7b97\u7b26\u90fd\u53ef\u4ee5\u4efb\u53d6\u4e09\u79cd\u3002<\/span>
\n\u56e0\u6b64\u5bf9\u4e8e\u6bcf\u4e2a\u524d\u7f00\u5f02\u6216\uff0c\u5176\u8d21\u732e\u4e3a\uff1ap<\/span>re<\/span>_<\/span>x<\/span>or<\/span>\u00d7<\/span><\/span>2<\/span>\u00d7<\/span><\/span>3^(n<\/span>\u2212<\/span>i<\/span>\u2212<\/span>1)<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span>\u3002<\/span><\/li>\n<\/ul>\n\u4ee3\u7801<\/h2>\n
const int mod = 1e9 + 7;\r\n\r\nint qmi(int a , int n)\r\n{\r\n int res = 1;\r\n while (n)\r\n {\r\n if (n & 1) res = res * a % mod;\r\n a = a * a % mod;\r\n n >>= 1;\r\n }\r\n\r\n return res;\r\n}\r\n\r\nvoid solve() \r\n{\r\n int n;\r\n cin >> n;\r\n int s = 0;\r\n int ans = 0;\r\n\r\n for (int i = 1 ; i <= n ; i ++ )\r\n {\r\n int num;\r\n cin >> num;\r\n s ^= num;\r\n\r\n if (i < n)\r\n ans += s * 2 * qmi(3LL , n - i - 1) % mod;\r\n else \r\n ans += s;\r\n \r\n ans %= mod;\r\n }\r\n\r\n cout << ans << endl;\r\n\r\n return ;\r\n}<\/pre>\n\u5b8c\u7ed3\u6492\u82b1\uff01<\/h1>\n","protected":false},"excerpt":{"rendered":"