{"id":96,"date":"2026-04-03T23:39:12","date_gmt":"2026-04-03T15:39:12","guid":{"rendered":"https:\/\/blog.kiloming.top\/?p=96"},"modified":"2026-04-03T23:53:36","modified_gmt":"2026-04-03T15:53:36","slug":"%e8%93%9d%e6%a1%a5%e6%9d%af%e5%a4%87%e8%b5%9bday1","status":"publish","type":"post","link":"https:\/\/blog.kiloming.top\/?p=96","title":{"rendered":"\u84dd\u6865\u676f\u5907\u8d5bDAY1"},"content":{"rendered":"\n
\n

\u524d\u8a00\uff1a<\/h2>\n<\/blockquote>\n\n\n\n

\u505a\u6a21\u62df\u9898\u7ed9\u6211\u505a\u7684\u9053\u5fc3\u7834\u788e\u4e86\uff0c\u8fd8\u662f\u8981\u7cfb\u7edf\u7684\u7ec3\u4e60\u4e00\u4e0b\uff0c\u4eca\u5929\u5c31\u5148\u7ec3\u4e60\u4e00\u4e0b\u7b80\u5355\u7684bfs\u548c\u524d\u7f00\u548c\u5427\uff0c \u5f53\u7136\u4e5f\u53ef\u4ee5\u8bbf\u95ee\u6211\u7684GitHubhttps:\/\/github.com\/KiloMing\/MyCode<\/a>\u3002<\/p>\n\n\n\n

\u7b2c\u4e00\u9898<\/h2>\n\n\n\n

\u8fd9\u9898\u592a\u7b80\u5355\uff0c\u4e0d\u597d\u610f\u601d\u62ff\u51fa\u6765\uff08\u4f46\u8fd8\u662f\u8981\u6ce8\u610f\u7ec6\u8282\u95ee\u9898\uff09<\/p>\n\n\n\n

\/*\n\u9898 1\uff1a\u95f0\u5e74\u7edf\u8ba1\n\n\u8f93\u5165\u4e24\u4e2a\u5e74\u4efd L, R\uff0c\u8f93\u51fa\u533a\u95f4 [L, R] \u4e2d\u95f0\u5e74\u7684\u4e2a\u6570\u3002\n\n\u76ee\u6807\n\n\u7ec3\uff1a\n\n\u6761\u4ef6\u5224\u65ad\n\u5faa\u73af\u679a\u4e3e\n\u57fa\u7840\u6a21\u62df\n\u77e5\u8bc6\u70b9\n\u95f0\u5e74\u5224\u65ad\n\u8fb9\u754c\u5904\u7406\n*\/\n#include <iostream>\nusing namespace std;\nbool JudgeYear(int year){\n    if((year % 4 == 0 && year % 100 != 0) || year % 400 == 0){\n        return true;\n    }else{\n        return false;\n    }\n}\nint main(){\n    int y1, y2;\n    int sum;\n    cin >> y1 >> y2;\n    for(int i = y1; i <= y2; i++){\n        if(JudgeYear(i)){\n            sum++;\n        }\n    }\n    cout << sum << endl;\n}<\/code><\/pre>\n\n\n\n
\u7b2c\u4e8c\u9898<\/h2>\n\n\n\n
\/*\n\u8f93\u5165 y, m, d\uff0c\u5224\u65ad\u8fd9\u4e2a\u65e5\u671f\u662f\u5426\u5408\u6cd5\u3002\n\n\u76ee\u6807\n\n\u7ec3\uff1a\n\n\u5206\u7c7b\u8ba8\u8bba\n\u6708\u4efd\u5929\u6570\n\u95f0\u5e74\u4e8c\u6708\n\u77e5\u8bc6\u70b9\n\u6a21\u62df\n\u6761\u4ef6\u5206\u652f\n*\/\n#include <iostream>\nusing namespace std;\n\nint month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n\nbool JudgeYear(int year){\n    if((year % 4 == 0 && year % 100 != 0) || year % 400 == 0){\n        return true;\n    }else{\n        return false;\n    }\n}\n\nint main(){\n    int year;\n    int mon;\n    int day;\n    cin >> year >> mon >> day;\n    if(JudgeYear(year)){\n        month[1] = 29;\n    }else{\n        month[1] = 28;\n    }\n    int flag = 1;\n    if(!(mon >= 1 && mon <= 12)){\n        flag = 0;\n    }else if(!(day >= 1 && day <= month[mon-1])){\n        flag = 0;\n    }\n    if(flag){\n        cout << \"Right\" << endl;\n    }else{\n        cout << \"Error\" << endl;\n    }\n    \n}\n<\/code><\/pre>\n\n\n\n
\u7b2c\u4e09\u9898<\/h2>\n\n\n\n
\u8fd9\u4e00\u9898\u4e00\u5b9a\u8981\u6ce8\u610f\uff0c\u5f53\u4f7f\u7528\u524d\u7f00\u548c\u6c42\u533a\u95f4[a, b]\u7684\u548c\u65f6\uff0c\u4e00\u5b9a\u662fs[b] - s[a-1]\u4e0d\u7136\u4f1a\u6f0f\u51cf\n\/*\n\u9898 3\uff1a\u533a\u95f4\u548c\u67e5\u8be2\n\u7ed9\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u7684\u6570\u7ec4\uff0c\u518d\u7ed9 q \u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u95ee\u533a\u95f4 [l, r] \u7684\u5143\u7d20\u548c\u3002\n\u8f93\u5165\u683c\u5f0f\n\u7b2c\u4e00\u884c n q\n\u7b2c\u4e8c\u884c n \u4e2a\u6574\u6570\n\u63a5\u4e0b\u6765 q \u884c\uff0c\u6bcf\u884c\u4e24\u4e2a\u6574\u6570 l r\n\u8f93\u51fa\n\u6bcf\u6b21\u8be2\u95ee\u8f93\u51fa\u4e00\u4e2a\u533a\u95f4\u548c\u3002\n\u76ee\u6807\n\u7ec3\uff1a\n\u524d\u7f00\u548c\u5b9a\u4e49\n\u533a\u95f4\u548c\u516c\u5f0f\n\u4e0b\u6807\u7a33\u5b9a\u6027\n\u8981\u6c42\n\u6570\u7ec4\u4f60\u5148\u7edf\u4e00\u6309 1 \u4e0b\u6807 \u5199\u4e00\u7248\uff0c\u518d\u6309 0 \u4e0b\u6807 \u81ea\u5df1\u91cd\u5199\u4e00\u7248\u3002\n*\/\n\n#include <iostream>\nusing namespace std;\nint main(){\n    int n, q;\n    cin >> n >> q;\n    int *a1 = new int[n];\n    cin >> a1[0];\n    for(int i = 1; i < n; i++){\n        cin >> a1[i];\n    }\n    int *s1 = new int[n+1];\n    s1[0] = 0;\n    for(int i = 0; i < n; i++){\n        s1[i+1] = s1[i] + a1[i];\n    }\n    int l, r;\n    for(int i = 0; i < q; i++){\n        cin >> l >> r;\n        cout << s1[r] - s1[l-1] << endl;  \/\/\u6ce8\u610f \uff1a\u8fd9\u91ccl\u8981\u51cf1\n    }\n\n}<\/code><\/pre>\n\n\n\n
\u7b2c\u56db\u9898<\/h2>\n\n\n\n
\u8fd9\u9898\u6d89\u53ca\u5230<unordered_map>\u5bb9\u5668\uff0c\u5b83\u4e0emap(map\u53ef\u4ee5\u53bb\u770b\u6211\u7684 C++ \u5bb9\u5668\u90a3\u4e00\u7bc7)\u7684\u533a\u522b\u662f\uff1a<\/p>\n\n\n\n
map<\/td>\u6709\u5e8f<\/td>\u7a0d\u5fae\u6709\u70b9\u6ee1<\/td><\/tr>
unordered_map<\/td>\u65e0\u5e8f<\/td>\u5feb\uff08\u54c8\u5e0c\uff09<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\/*\n\u9898 4\uff1a\u548c\u4e3a 0 \u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4\n\u7ed9\u4e00\u4e2a\u6570\u7ec4\uff0c\u6c42\u548c\u4e3a 0 \u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4\u957f\u5ea6\u3002\n\u76ee\u6807\n\u77e5\u8bc6\u70b9\n\u524d\u7f00\u548c\n\u54c8\u5e0c\u8868\u8bb0\u5f55\u524d\u7f00\u548c\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e\n\u6838\u5fc3\u601d\u8def\u63d0\u793a\n\u5982\u679c s[i] == s[j]\uff0c\u90a3\u4e2d\u95f4\u8fd9\u6bb5\u548c\u5c31\u662f 0\u3002\n\u8981\u6c42\n\u4e0d\u80fd\u5199\u53cc\u91cd\u5faa\u73af\uff0c\u5fc5\u987b\u7ec3\u6210 O(n)\u3002*\/\n#include <iostream>\n#include <unordered_map>\nusing namespace std;\nint main(){\n    int n;\n    cin >> n;\n    int *a = new int[n];\n    for(int i = 0; i < n; i++){\n        cin >> a[i];\n    }\n    unordered_map<int, int> map;\n    map[0] = -1;   \/\/\u4e0d\u8981\u5fd8\u8bb0\u521d\u59cb\u5316\n    int sum = 0;\n    int ans = 0;\n    for(int i = 0;i < n; i++){\n        sum += a[i];\n        if(map.count(sum)){\n            ans = max(ans, i - map[sum]);\n        }else{\n            map[sum] = i;\n        }\n    }\n    cout << ans <<endl;\n}\n<\/code><\/pre>\n\n\n\n
\u7b2c\u4e94\u9898<\/h2>\n\n\n\n
\u8fd9\u4e00\u9898\u7275\u626f\u5230\u7b80\u5355\u7684dfs\u548c\u56de\u6eaf\uff0c\u53ef\u4ee5\u770b\u4e00\u4e0b\u6211\u7684CSND\uff1ahttps:\/\/blog.csdn.net\/2501_94293581\/article\/details\/158704997?spm=1001.2014.3001.5501<\/a><\/p>\n\n\n\n
\/*\n\u9898 5\uff1a\u8f93\u51fa 1~n \u7684\u6240\u6709\u7ec4\u5408\n\u8f93\u5165 n, k\uff0c\u8f93\u51fa\u4ece 1~n \u4e2d\u9009 k \u4e2a\u6570\u7684\u6240\u6709\u7ec4\u5408\u3002\n\u76ee\u6807\n\u7ec3\uff1a\n\u7ec4\u5408\u679a\u4e3e\n\u8def\u5f84 path\n\u56de\u6eaf\u5199\u6cd5\n\u7ec8\u70b9 return\n\u77e5\u8bc6\u70b9\nDFS\n\u56de\u6eaf\n\u8981\u6c42\n\u8fd9\u9898\u4f60\u8981\u7279\u522b\u6ce8\u610f\uff1a\n\u5230 path.size() == k \u540e\u7acb\u523b return\u3002*\/\n#include <iostream>\n#include <vector>\nusing namespace std;\nvoid Compare(int start, int n, int k, vector<int> &path){\n    if(path.size() == k){\n        for(int i = 0;i < path.size(); i++){\n            cout << path[i] << \" \";\n        }\n        cout << endl;\n        return;\n    }\n    for(int i = start; i <= n; i++){\n        path.push_back(i);\n        Compare(i+1, n, k, path);\n        path.pop_back();\n    }\n\n}\n\nint main(){\n    int n, k;\n    cin >> n >> k;\n    vector<int> path;\n    Compare(1, n, k, path);\n    \n}<\/code><\/pre>\n\n\n\n
\u7b2c\u516d\u9898\uff1a<\/h2>\n\n\n\n
\u521a\u5f00\u59cb\u60f3\u7684\u9ebb\u70e6\u4e86\uff0c\u7528vector\u56de\u6eaf\u5217\u51fa\u4e86\u6240\u6709\u7ec4\u5408\u518d\u76f8\u52a0\uff0c\u5f53\u6570\u6bd4\u8f83\u5c0f\u7684\u65f6\u5019\u53ef\u4ee5\uff0c\u4f46\u662f\u5982\u679c\u7ade\u8d5b\u80af\u5b9a\u8fc7\u4e0d\u4e86\uff0c\u6240\u4ee5\u5c31\u7528dfs\uff0c\u904d\u5386\u5230\u8fd9\u4e2a\u5143\u7d20\u7684\u65f6\u5019\u5c31\u4e24\u79cd\u9009\u62e9\u9009\u8fd8\u662f\u4e0d\u9009<\/p>\n\n\n\n
\/*\n\u9898 6\uff1a\u5b50\u96c6\u548c\u4e2a\u6570\n\u7ed9\u5b9a n \u4e2a\u6570\u548c\u76ee\u6807\u503c S\uff0c\u95ee\u6709\u591a\u5c11\u79cd\u9009\u6cd5\u4f7f\u5f97\u9009\u51fa\u7684\u6570\u4e4b\u548c\u7b49\u4e8e S\u3002\n\u76ee\u6807\n\u7ec3\uff1a\nDFS \u679a\u4e3e\u9009\u6216\u4e0d\u9009\n\u53c2\u6570\u4f20\u9012\u5f53\u524d\u548c\n\u4e0d\u91cd\u590d\u8ba1\u7b97\n\u77e5\u8bc6\u70b9\n\u5b50\u96c6\u679a\u4e3e\n\u9012\u5f52\n\u8981\u6c42\n\n\u8fd9\u9898\u4e0d\u8981\u6bcf\u6b21\u641c\u5230\u53f6\u5b50\u518d\u904d\u5386\u6570\u7ec4\u6c42\u548c\uff0c\u76f4\u63a5\u628a sum \u5f53\u53c2\u6570\u4f20\u4e0b\u53bb\u3002*\/\n\/*\n\u9898 5\uff1a\u8f93\u51fa 1~n \u7684\u6240\u6709\u7ec4\u5408\n\u8f93\u5165 n, k\uff0c\u8f93\u51fa\u4ece 1~n \u4e2d\u9009 k \u4e2a\u6570\u7684\u6240\u6709\u7ec4\u5408\u3002\n\u76ee\u6807\n\u7ec3\uff1a\n\u7ec4\u5408\u679a\u4e3e\n\u8def\u5f84 path\n\u56de\u6eaf\u5199\u6cd5\n\u7ec8\u70b9 return\n\u77e5\u8bc6\u70b9\nDFS\n\u56de\u6eaf\n\u8981\u6c42\n\u8fd9\u9898\u4f60\u8981\u7279\u522b\u6ce8\u610f\uff1a\n\u5230 path.size() == k \u540e\u7acb\u523b return\u3002*\/\n#include <iostream>\n#include <vector>\n#include <unordered_map>\nusing namespace std;\n\nint n, S;\nint a[1005];\nint ans = 0;\nvoid dfs(int u, int sum){\n    if(u == n){\n        if(sum == S) ans++;\n        return;    \/\/\u6ce8\u610f\u4e00\u5b9a\u8981return\n    }\n    dfs(u+1, sum);   \/\/\u4e0d\u9009\n    dfs(u+1, sum+a[u]); \/\/ \u9009\n}\n\n\n\nint main(){\n    cin >> n >> S;\n    for(int i = 0; i < n; i++){\n        cin >> a[i];\n    }\n    dfs(0, 0);\n    cout << ans << endl;\n    \n}\n<\/code><\/pre>\n\n\n\n
\u603b\u7ed3<\/h2>\n\n\n\n
\u4eca\u5929\u7684\u9898\u8fd8\u662f\u633a\u57fa\u7840\u7684\uff0c\u4f46\u8981\u5427\u7ec6\u8282\u505a\u597d\uff0c\u6bd4\u5982\u524d\u7f00\u548c\u7684\u8fb9\u754c\u95ee\u9898\uff0c\u56de\u6eaf\u548cdfs\u7684\u6a21\u7248\u4e0d\u80fd\u5199\u9519\uff1b<\/p>\n","protected":false},"excerpt":{"rendered":"
\u524d\u8a00\uff1a \u505a\u6a21\u62df\u9898\u7ed9\u6211\u505a\u7684\u9053\u5fc3\u7834\u788e\u4e86\uff0c\u8fd8\u662f\u8981\u7cfb\u7edf\u7684\u7ec3\u4e60\u4e00\u4e0b\uff0c\u4eca\u5929\u5c31\u5148\u7ec3\u4e60\u4e00\u4e0b\u7b80\u5355\u7684bfs\u548c\u524d\u7f00\u548c\u5427\uff0c \u5f53\u7136\u4e5f\u53ef\u4ee5 […]<\/p>\n","protected":false},"author":1,"featured_media":99,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7,8,20,19],"tags":[],"class_list":["post-96","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-learn","category-text","category-20","category-shuibi"],"_links":{"self":[{"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/posts\/96","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=96"}],"version-history":[{"count":2,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/posts\/96\/revisions"}],"predecessor-version":[{"id":102,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/posts\/96\/revisions\/102"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=\/wp\/v2\/media\/99"}],"wp:attachment":[{"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=96"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=96"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.kiloming.top\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=96"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}