{"id":409,"date":"2024-12-07T02:33:44","date_gmt":"2024-12-06T18:33:44","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=409"},"modified":"2024-12-07T02:33:45","modified_gmt":"2024-12-06T18:33:45","slug":"nenuacm-%e4%ba%8c%e5%88%86%e4%b9%a0%e9%a2%98%e8%af%be","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/12\/07\/nenuacm-%e4%ba%8c%e5%88%86%e4%b9%a0%e9%a2%98%e8%af%be\/","title":{"rendered":"NENUACM \u4e8c\u5206\u4e60\u9898\u8bfe"},"content":{"rendered":"\n

NENUACM\u57f9\u8bad\u4e8c\u5206\u4e13\u9898 – Virtual Judge<\/a><\/h2>\n\n\n\n

A – \u67e5\u627e<\/a><\/h2>\n\n\n\n
\n

Description<\/h3>\n\n\n\n

\u8f93\u5165 nn<\/em> \u4e2a\u4e0d\u8d85\u8fc7 109109 \u7684\u5355\u8c03\u4e0d\u51cf\u7684\uff08\u5c31\u662f\u540e\u9762\u7684\u6570\u5b57\u4e0d\u5c0f\u4e8e\u524d\u9762\u7684\u6570\u5b57\uff09\u975e\u8d1f\u6574\u6570 a1,a2,\u2026,ana<\/em>1,a<\/em>2,\u2026,a**n<\/em>\uff0c\u7136\u540e\u8fdb\u884c mm<\/em> \u6b21\u8be2\u95ee\u3002\u5bf9\u4e8e\u6bcf\u6b21\u8be2\u95ee\uff0c\u7ed9\u51fa\u4e00\u4e2a\u6574\u6570 qq<\/em>\uff0c\u8981\u6c42\u8f93\u51fa\u8fd9\u4e2a\u6570\u5b57\u5728\u5e8f\u5217\u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u7f16\u53f7\uff0c\u5982\u679c\u6ca1\u6709\u627e\u5230\u7684\u8bdd\u8f93\u51fa \u22121\u22121 \u3002<\/p>\n\n\n\n

Input<\/h3>\n\n\n\n

\u7b2c\u4e00\u884c 22 \u4e2a\u6574\u6570 nn<\/em> \u548c mm<\/em>\uff0c\u8868\u793a\u6570\u5b57\u4e2a\u6570\u548c\u8be2\u95ee\u6b21\u6570\u3002<\/p>\n\n\n\n

\u7b2c\u4e8c\u884c nn<\/em> \u4e2a\u6574\u6570\uff0c\u8868\u793a\u8fd9\u4e9b\u5f85\u67e5\u8be2\u7684\u6570\u5b57\u3002<\/p>\n\n\n\n

\u7b2c\u4e09\u884c mm<\/em> \u4e2a\u6574\u6570\uff0c\u8868\u793a\u8be2\u95ee\u8fd9\u4e9b\u6570\u5b57\u7684\u7f16\u53f7\uff0c\u4ece 11 \u5f00\u59cb\u7f16\u53f7\u3002<\/p>\n\n\n\n

Output<\/h3>\n\n\n\n

\u8f93\u51fa\u4e00\u884c\uff0cmm<\/em> \u4e2a\u6574\u6570\uff0c\u4ee5\u7a7a\u683c\u9694\u5f00\uff0c\u8868\u793a\u7b54\u6848\u3002<\/p>\n\n\n\n

Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
11 3 1 3 3 3 5 7 9 11 13 15 15 1 3 6<\/code><\/td>1 2 -1<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Hint<\/h3>\n\n\n\n

\u6570\u636e\u4fdd\u8bc1\uff0c1\u2264n\u22641061\u2264n<\/em>\u2264106\uff0c0\u2264ai,q\u22641090\u2264a**i<\/em>,q<\/em>\u2264109\uff0c1\u2264m\u22641051\u2264m<\/em>\u2264105<\/p>\n\n\n\n

\u672c\u9898\u8f93\u5165\u8f93\u51fa\u91cf\u8f83\u5927\uff0c\u8bf7\u4f7f\u7528\u8f83\u5feb\u7684 IO \u65b9\u5f0f\u3002<\/p>\n<\/blockquote>\n\n\n\n

\u4ee3\u7801 \u4e8c\u5206STL\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\nint a[MAXN];\nint main(){\n    int n,m;\n    cin >> n >> m;\n    \/\/ \u5df2\u7ecf\u4fdd\u8bc1\u4e86\u5355\u8c03\u4e0d\u51cf\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n    }\n    while(m--){\n        int q;\n        cin >> q;\n        int res = lower_bound(a + 1,a + n + 1,q) - a;\n        if(a[res] == q){\n            cout << res << \" \";\n        }else{\n            cout << -1 << \" \";\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801 \u624b\u5199\u4e8c\u5206\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\nint a[MAXN];\nint main(){\n    int n,m;\n    cin >> n >> m;\n    \/\/ \u5df2\u7ecf\u4fdd\u8bc1\u4e86\u5355\u8c03\u4e0d\u51cf\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n    }\n    while(m--){\n        int q;\n        cin >> q;\n        int l = 1,r = n;\n        while(l < r){\n            int mid = (l + r) >> 1;\n            if(a[mid] >= q) r = mid;\n            else l = mid + 1;\n        }\n        if(a[l] == q){\n            cout << l << \" \";\n        }else{\n            cout << -1 << \" \";\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
B – \u5207\u7ef3\u5b50<\/a><\/h2>\n\n\n\n
\n
Description<\/h3>\n\n\n\n
\u6709 NN<\/em> \u6761\u7ef3\u5b50\uff0c\u5b83\u4eec\u7684\u957f\u5ea6\u5206\u522b\u4e3a LiL**i<\/em>\u3002\u5982\u679c\u4ece\u5b83\u4eec\u4e2d\u5207\u5272\u51fa KK<\/em> \u6761\u957f\u5ea6\u76f8\u540c\u7684\u7ef3\u5b50\uff0c\u8fd9 KK<\/em> \u6761\u7ef3\u5b50\u6bcf\u6761\u6700\u957f\u80fd\u6709\u591a\u957f\uff1f\u7b54\u6848\u4fdd\u7559\u5230\u5c0f\u6570\u70b9\u540e 22 \u4f4d(\u76f4\u63a5\u820d\u6389 22 \u4f4d\u540e\u7684\u5c0f\u6570)\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\u4e24\u4e2a\u6574\u6570 NN<\/em> \u548c KK<\/em>\uff0c\u63a5\u4e0b\u6765 NN<\/em> \u884c\uff0c\u63cf\u8ff0\u4e86\u6bcf\u6761\u7ef3\u5b50\u7684\u957f\u5ea6 LiL**i<\/em> \u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u5207\u5272\u540e\u6bcf\u6761\u7ef3\u5b50\u7684\u6700\u5927\u957f\u5ea6\u3002\u7b54\u6848\u4e0e\u6807\u51c6\u7b54\u6848\u8bef\u5dee\u4e0d\u8d85\u8fc7 0.010.01 \u6216\u8005\u76f8\u5bf9\u8bef\u5dee\u4e0d\u8d85\u8fc7 1%1% \u5373\u53ef\u901a\u8fc7\u3002<\/p>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
4 11 8.02 7.43 4.57 5.39<\/code><\/td>2.00<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
Hint<\/h3>\n\n\n\n
\u5bf9\u4e8e 100%100% \u7684\u6570\u636e 0<Li\u2264100000.00,0<n\u226410000,0<k\u2264100000<L**i<\/em>\u2264100000.00,0<n<\/em>\u226410000,0<k<\/em>\u226410000<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801 \u6574\u6570\u4e8c\u5206\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\nint a[MAXN];\nint n,k;\nint cal(int mid){\n    int ans = 0;\n    for(int i = 1;i <= n;i++){\n        ans += a[i] \/ mid;\n    }\n    return ans;\n}\n\nint main(){\n    cin >> n >> k;\n    for(int i = 1;i <= n;i++){\n        double temp;\n        cin >> temp;\n        a[i] = temp * 100;\n    }\n\n    int l = 0,r = 100000000;\n    while(l < r){\n        int mid = (l + r + 1) >> 1;\n        if(cal(mid) >= k){\n            l = mid;\n        }else{\n            r = mid - 1;\n        }\n    }\n    double ans = l \/ 100.0;\n    cout << fixed << setprecision(2) << ans << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801 \u6d6e\u70b9\u4e8c\u5206\u3010\u7cbe\u5ea6\u95ee\u9898\u3011\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\ndouble a[MAXN];\nint n,k;\nint cal(double mid){\n    int ans = 0;\n    for(int i = 1;i <= n;i++){\n        ans += (int)(a[i] \/ mid);\n    }\n    return ans;\n}\n\nint main(){\n    cin >> n >> k;\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n    }\n\n    double l = 0.0,r = 100000.0;\n    int cnt = 1;\n    while(cnt <= 100){\n        cnt++; \/\/ \u8fd9\u91cc\u6211\u4eec\u4f7f\u7528\u6b21\u6570\u6765\u51b3\u5b9a\u7cbe\u5ea6\uff0c\u5426\u5219\u4e0d\u597d\u5904\u7406\n        double mid = (l + r) \/ 2.0;\n        \/\/ \u6211\u4eec\u8981\u627e\u5230\u6700\u540e\u4e00\u4e2a\u5927\u4e8e\u7b49\u4e8e\u7684 \u5c3d\u53ef\u80fd\u5f80\u53f3\u8fb9\u627e\uff08\u56e0\u4e3a\u5408\u6cd5\u7b54\u6848\u53ef\u80fd\u662f\u4e2a\u8303\u56f4\uff09\n        if(cal(mid) >= k){\n            l = mid; \/\/ \u6b64\u65f6\u7b97\u591a\u4e86\uff0c\u8bf4\u660emid\u5c0f\u4e86\uff0c\u8981\u5f80\u53f3\u8fb9\u627e\n        }else{\n            r = mid;\n        }\n    }\n    \/\/ \u8fd9\u91cc\u6ce8\u610fqwq \u4e0d\u8981\u8fd9\u4e48\u5199 \u56e0\u4e3a\u56db\u820d\u4e94\u5165\n    \/\/ cout << fixed << setprecision(2) << l << \"\\n\";\n    int ans = l * 100;\n    cout << fixed << setprecision(2) << ans \/ 100.0 << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
C – A-B \u6570\u5bf9<\/a><\/h2>\n\n\n\n
\n
Background<\/h3>\n\n\n\n
\u51fa\u9898\u662f\u4e00\u4ef6\u75db\u82e6\u7684\u4e8b\u60c5\uff01<\/p>\n\n\n\n
\u76f8\u540c\u7684\u9898\u76ee\u770b\u591a\u4e86\u4e5f\u4f1a\u6709\u5ba1\u7f8e\u75b2\u52b3\uff0c\u4e8e\u662f\u6211\u820d\u5f03\u4e86\u5927\u5bb6\u6240\u719f\u6089\u7684 A+B Problem\uff0c\u6539\u7528 A-B \u4e86\u54c8\u54c8\uff01<\/p>\n\n\n\n
Description<\/h3>\n\n\n\n
\u7ed9\u51fa\u4e00\u4e32\u6b63\u6574\u6570\u6570\u5217\u4ee5\u53ca\u4e00\u4e2a\u6b63\u6574\u6570 CC<\/em>\uff0c\u8981\u6c42\u8ba1\u7b97\u51fa\u6240\u6709\u6ee1\u8db3 A\u2212B=CA<\/em>\u2212B<\/em>=C<\/em> \u7684\u6570\u5bf9\u7684\u4e2a\u6570\uff08\u4e0d\u540c\u4f4d\u7f6e\u7684\u6570\u5b57\u4e00\u6837\u7684\u6570\u5bf9\u7b97\u4e0d\u540c\u7684\u6570\u5bf9\uff09\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u8f93\u5165\u5171\u4e24\u884c\u3002<\/p>\n\n\n\n
\u7b2c\u4e00\u884c\uff0c\u4e24\u4e2a\u6b63\u6574\u6570 N,CN<\/em>,C<\/em>\u3002<\/p>\n\n\n\n
\u7b2c\u4e8c\u884c\uff0cNN<\/em> \u4e2a\u6b63\u6574\u6570\uff0c\u4f5c\u4e3a\u8981\u6c42\u5904\u7406\u7684\u90a3\u4e32\u6570\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u884c\uff0c\u8868\u793a\u8be5\u4e32\u6b63\u6574\u6570\u4e2d\u5305\u542b\u7684\u6ee1\u8db3 A\u2212B=CA<\/em>\u2212B<\/em>=C<\/em> \u7684\u6570\u5bf9\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
4 1 1 1 2 3<\/code><\/td>3<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
Hint<\/h3>\n\n\n\n
\u5bf9\u4e8e 75%75% \u7684\u6570\u636e\uff0c1\u2264N\u226420001\u2264N<\/em>\u22642000\u3002<\/p>\n\n\n\n
\u5bf9\u4e8e 100%100% \u7684\u6570\u636e\uff0c1\u2264N\u22642\u00d71051\u2264N<\/em>\u22642\u00d7105\uff0c0\u2264ai<2300\u2264a**i<\/em><230\uff0c1\u2264C<2301\u2264C<\/em><230\u3002<\/p>\n\n\n\n
2017\/4\/29 \u65b0\u6dfb\u6570\u636e\u4e24\u7ec4<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801 \u4e8c\u5206\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\nint a[MAXN];\nint main(){\n    int n,c;\n    cin >> n >> c;\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n    }\n    sort(a + 1,a + n + 1);\n    long long ans = 0;\n    for(int i = 1;i <= n;i++){\n        \/\/ \u5047\u8bbe\u6bcf\u4e2a\u6570\u5b57\u90fd\u662f\u6570\u5b57b\n        \/\/ \u627ea\u6570\u5b57\u662f\u5426\u5b58\u5728\n        \/\/ \u7b26\u5408\u7684a\u7684\u6570\u91cf\u662f == a \u7684\u90a3\u51e0\u4e2a\uff0c\u53ef\u4ee5\u7528\u4e0b\u9762\u8fd9\u79cd\u5199\u6cd5\u5904\u7406\n        ans += (upper_bound(a + 1,a + n + 1,a[i] + c) - a) - (lower_bound(a + 1,a + n + 1,a[i] + c) - a);\n    }\n    cout << ans << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801 map\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nmap<int, int> freq;\nint arr[200005];\nint main() {\n    int n, c;\n    cin >> n >> c;\n\n    \/\/ \u8bfb\u53d6\u6570\u7ec4\u5e76\u66f4\u65b0\u54c8\u5e0c\u8868\n    for (int i = 1; i <= n; i++) {\n        cin >> arr[i];\n        freq[arr[i]]++;  \/\/ \u5f53\u524d\u6570\u7684\u4e2a\u6570++\n    }\n\n    long long ans = 0;\n\n    \/\/ \u8ba1\u7b97\u7b26\u5408\u6761\u4ef6\u7684\u6570\u5bf9\u4e2a\u6570\n    for (int i = 1; i <= n; i++) {\n        ans += freq[arr[i] + c];  \/\/ \u76f8\u5dee\u4e3ac\u7684\u6570\u7684\u4e2a\u6570\n    }\n\n    cout << ans << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
D – \u70e6\u607c\u7684\u9ad8\u8003\u5fd7\u613f<\/a><\/h2>\n\n\n\n
\n
Background<\/h3>\n\n\n\n
\u8ba1\u7b97\u673a\u7ade\u8d5b\u5c0f\u7ec4\u7684\u795e\u725b V \u795e\u7ec8\u4e8e\u7ed3\u675f\u4e86\u9ad8\u8003\uff0c\u7136\u800c\u4f5c\u4e3a\u73ed\u957f\u7684\u4ed6\u8fd8\u4e0d\u80fd\u95f2\u4e0b\u6765\uff0c\u73ed\u4e3b\u4efb\u8001 t \u7ed9\u4e86\u4ed6\u4e00\u4e2a\u8270\u5de8\u7684\u4efb\u52a1\uff1a\u5e2e\u540c\u5b66\u627e\u51fa\u6700\u5408\u7406\u7684\u5927\u5b66\u586b\u62a5\u65b9\u6848\u3002\u53ef\u662f v \u795e\u592a\u5fd9\u4e86\uff0c\u8eab\u540e\u8fd8\u6709\u4e00\u7fa4\u5c0f\u59d1\u5a18\u7b49\u7740\u548c\u4ed6\u7ea6\u4f1a\uff0c\u4e8e\u662f\u4ed6\u60f3\u5230\u4e86\u540c\u4e3a\u8ba1\u7b97\u673a\u7ade\u8d5b\u5c0f\u7ec4\u7684\u4f60\uff0c\u8bf7\u4f60\u5e2e\u4ed6\u5b8c\u6210\u8fd9\u4e2a\u8270\u5de8\u7684\u4efb\u52a1\u3002<\/p>\n\n\n\n
Description<\/h3>\n\n\n\n
\u73b0\u6709 mm<\/em> \u6240\u5b66\u6821\uff0c\u6bcf\u6240\u5b66\u6821\u9884\u8ba1\u5206\u6570\u7ebf\u662f aia**i<\/em>\u3002\u6709 nn<\/em> \u4f4d\u5b66\u751f\uff0c\u4f30\u5206\u5206\u522b\u4e3a bib**i<\/em>\u3002<\/p>\n\n\n\n
\u6839\u636e nn<\/em> \u4f4d\u5b66\u751f\u7684\u4f30\u5206\u60c5\u51b5\uff0c\u5206\u522b\u7ed9\u6bcf\u4f4d\u5b66\u751f\u63a8\u8350\u4e00\u6240\u5b66\u6821\uff0c\u8981\u6c42\u5b66\u6821\u7684\u9884\u8ba1\u5206\u6570\u7ebf\u548c\u5b66\u751f\u7684\u4f30\u5206\u76f8\u5dee\u6700\u5c0f\uff08\u53ef\u9ad8\u53ef\u4f4e\uff0c\u6bd5\u7adf\u662f\u4f30\u5206\u561b\uff09\uff0c\u8fd9\u4e2a\u6700\u5c0f\u503c\u4e3a\u4e0d\u6ee1\u610f\u5ea6\u3002\u6c42\u6240\u6709\u5b66\u751f\u4e0d\u6ee1\u610f\u5ea6\u548c\u7684\u6700\u5c0f\u503c\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\u8bfb\u5165\u4e24\u4e2a\u6574\u6570 m,nm<\/em>,n<\/em>\u3002mm<\/em> \u8868\u793a\u5b66\u6821\u6570\uff0cnn<\/em> \u8868\u793a\u5b66\u751f\u6570\u3002<\/p>\n\n\n\n
\u7b2c\u4e8c\u884c\u5171\u6709 mm<\/em> \u4e2a\u6570\uff0c\u8868\u793a mm<\/em> \u4e2a\u5b66\u6821\u7684\u9884\u8ba1\u5f55\u53d6\u5206\u6570\u3002\u7b2c\u4e09\u884c\u6709 nn<\/em> \u4e2a\u6570\uff0c\u8868\u793a nn<\/em> \u4e2a\u5b66\u751f\u7684\u4f30\u5206\u6210\u7ee9\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u8f93\u51fa\u4e00\u884c\uff0c\u4e3a\u6700\u5c0f\u7684\u4e0d\u6ee1\u5ea6\u4e4b\u548c\u3002<\/p>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
4 3 513 598 567 689 500 600 550<\/code><\/td>32<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
Hint<\/h3>\n\n\n\n
\u6570\u636e\u8303\u56f4\uff1a<\/p>\n\n\n\n
\u5bf9\u4e8e 30%30% \u7684\u6570\u636e\uff0c1\u2264n,m\u226410001\u2264n<\/em>,m<\/em>\u22641000\uff0c\u4f30\u5206\u548c\u5f55\u53d6\u7ebf \u226410000\u226410000\uff1b<\/p>\n\n\n\n
\u5bf9\u4e8e 100%100% \u7684\u6570\u636e\uff0c1\u2264n,m\u22641000001\u2264n<\/em>,m<\/em>\u2264100000\uff0c\u4f30\u5206\u548c\u5f55\u53d6\u7ebf \u22641000000\u22641000000 \u4e14\u5747\u4e3a\u975e\u8d1f\u6574\u6570\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6 + 7;\nint a[MAXN];\n\nint main() {\n    int m,n;\n    cin >> m >> n;\n    for(int i = 1;i <= m;i++){\n        cin >> a[i];\n    }\n    sort(a + 1,a + m + 1);\n    long long ans = 0;\n    for(int i = 1;i <= n;i++){\n        int q;\n        cin >> q; \/\/ \u5b66\u751f\u5206\u6570\n        int index = lower_bound(a + 1,a + m + 1,q) - a; \/\/ \u627e\u4e00\u4e0b\u5927\u4e8e\u7b49\u4e8eq\u7684\u4f4d\u7f6e\n        if(index == m + 1){ \/\/ \u5206\u6570\u6bd4\u5b66\u6821\u8fd8\u5927\n            ans += q - a[index - 1];\n        }else if(index == 1){ \/\/ \u5206\u6570\u5c0f\u4e8e\u7b49\u4e8e\u6700\u5c0f\u7684\u5b66\u6821\n            ans += a[1] - q;\n        }else{\n            ans += min(abs(a[index] - q),abs(q - a[index - 1])); \/\/ \u524d\u9762\u4e00\u6240\u548c\u540e\u9762\u4e00\u6240\u4e2d\u9009\u62e9\u4e00\u4e2a\n        }\n    }\n    cout << ans << \"\\n\";\n}<\/code><\/pre>\n\n\n\n
E – \u89e3\u65b9\u7a0b<\/a><\/h2>\n\n\n\n
\n
\u5bf9\u4e8e\u65b9\u7a0b 2018 * x ^ 4 + 21 * x + 5 * x ^ 3 + 5 * x ^ 2 + 14 = Y\uff0c \u544a\u8bc9\u4f60Y\u7684\u503c\uff0c\u4f60\u80fd\u627e\u51fa\u65b9\u7a0b\u57280~100\u4e4b\u95f4\u7684\u89e3\u5417\uff1f<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u7b2c\u4e00\u884c\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570T\uff08\u8868\u793a\u6837\u4f8b\u4e2a\u6570\uff09
\u63a5\u4e0b\u6765T\u7ec4\u6837\u4f8b
\u6bcf\u7ec4\u6837\u4f8b\u4e00\u884c\uff0c\u8f93\u5165\u4e00\u4e2a\u5b9e\u6570Y<\/pre>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u884c\u8f93\u51fa\u4e00\u4e2a\u6837\u4f8b\u5bf9\u5e94\u7684\u7ed3\u679c\uff0c
\u8f93\u51fa\u65b9\u7a0b\u57280~100\u4e4b\u95f4\u7684\u89e3\uff0c\u4fdd\u7559\u5c0f\u6570\u70b9\u540e4\u4f4d\u5c0f\u6570\uff1b\u5982\u679c\u4e0d\u5b58\u5728\uff0c\u8f93\u51fa -1<\/pre>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
2 1 20180421<\/code><\/td>-1 9.9993<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    int n;\n    cin >> n;\n    while (n--) {\n        double r = 100, l = 0, m, y;\n        cin >> y;\n        int cnt = 0;\n        while(cnt < 1000) {\n            cnt++;\n            m = (r + l) \/ 2;\n            if (2018 * m * m * m * m + 21 * m + 5 * m * m * m + 5 * m * m + 14 < y)\n                l = m;\n            else\n                r = m;\n        }\n        if (l == 0 || r == 100)\n            cout << \"-1\\n\";\n        else\n            cout << fixed << setprecision(4) << m << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
F – \u8df3\u77f3\u5934<\/a><\/h2>\n\n\n\n
\n
\u4e00\u5e74\u4e00\u5ea6\u7684\u201c\u8df3\u77f3\u5934\u201d\u6bd4\u8d5b\u53c8\u8981\u5f00\u59cb\u4e86\uff01<\/p>\n\n\n\n
\u8fd9\u9879\u6bd4\u8d5b\u5c06\u5728\u4e00\u6761\u7b14\u76f4\u7684\u6cb3\u9053\u4e2d\u8fdb\u884c\uff0c\u6cb3\u9053\u4e2d\u5206\u5e03\u7740\u4e00\u4e9b\u5de8\u5927\u5ca9\u77f3\u3002\u7ec4\u59d4\u4f1a\u5df2\u7ecf\u9009\u62e9\u597d\u4e86\u4e24\u5757\u5ca9\u77f3\u4f5c\u4e3a\u6bd4\u8d5b\u8d77\u70b9\u548c\u7ec8\u70b9\u3002\u5728\u8d77\u70b9\u548c\u7ec8\u70b9\u4e4b\u95f4\uff0c\u6709 N \u5757\u5ca9\u77f3\uff08\u4e0d\u542b\u8d77\u70b9\u548c\u7ec8\u70b9\u7684\u5ca9\u77f3\uff09\u3002\u5728\u6bd4\u8d5b\u8fc7\u7a0b\u4e2d\uff0c\u9009\u624b\u4eec\u5c06\u4ece\u8d77\u70b9\u51fa\u53d1\uff0c\u6bcf\u4e00\u6b65\u8df3\u5411\u76f8\u90bb\u7684\u5ca9\u77f3\uff0c\u76f4\u81f3\u5230\u8fbe\u7ec8\u70b9\u3002<\/p>\n\n\n\n
\u4e3a\u4e86\u63d0\u9ad8\u6bd4\u8d5b\u96be\u5ea6\uff0c\u7ec4\u59d4\u4f1a\u8ba1\u5212\u79fb\u8d70\u4e00\u4e9b\u5ca9\u77f3\uff0c\u4f7f\u5f97\u9009\u624b\u4eec\u5728\u6bd4\u8d5b\u8fc7\u7a0b\u4e2d\u7684\u6700\u77ed\u8df3\u8dc3\u8ddd\u79bb\u5c3d\u53ef\u80fd\u957f\u3002\u7531\u4e8e\u9884\u7b97\u9650\u5236\uff0c\u7ec4\u59d4\u4f1a\u81f3\u591a\u4ece\u8d77\u70b9\u548c\u7ec8\u70b9\u4e4b\u95f4\u79fb\u8d70 M \u5757\u5ca9\u77f3\uff08\u4e0d\u80fd\u79fb\u8d70\u8d77\u70b9\u548c\u7ec8\u70b9\u7684\u5ca9\u77f3\uff09\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u7b2c\u4e00\u884c\u5305\u542b\u4e09\u4e2a\u6574\u6570 L\uff0cN\uff0cM\uff0c\u5206\u522b\u8868\u793a\u8d77\u70b9\u5230\u7ec8\u70b9\u7684\u8ddd\u79bb\uff0c\u8d77\u70b9\u548c\u7ec8\u70b9\u4e4b\u95f4\u7684\u5ca9\u77f3\u6570\uff0c\u4ee5\u53ca\u7ec4\u59d4\u4f1a\u81f3\u591a\u79fb\u8d70\u7684\u5ca9\u77f3\u6570\u3002
\u63a5\u4e0b\u6765 N \u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u6574\u6570\uff0c\u7b2c i \u884c\u7684\u6574\u6570 Di\uff080 < Di < L\uff09\u8868\u793a\u7b2c i\u5757\u5ca9\u77f3\u4e0e\u8d77\u70b9\u7684\u8ddd\u79bb\u3002\u8fd9\u4e9b\u5ca9\u77f3\u6309\u4e0e\u8d77\u70b9\u8ddd\u79bb\u4ece\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u7ed9\u51fa\uff0c\u4e14\u4e0d\u4f1a\u6709\u4e24\u4e2a\u5ca9\u77f3\u51fa\u73b0\u5728\u540c\u4e00\u4e2a\u4f4d\u7f6e\u3002<\/pre>\n\n\n\n
Output<\/h3>\n\n\n\n
\u8f93\u51fa\u6587\u4ef6\u53ea\u5305\u542b\u4e00\u4e2a\u6574\u6570\uff0c\u5373\u6700\u77ed\u8df3\u8dc3\u8ddd\u79bb\u7684\u6700\u5927\u503c\u3002<\/pre>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
25 5 2 2 11 14 17 21<\/code><\/td>4<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\u5c06\u4e0e\u8d77\u70b9\u8ddd\u79bb\u4e3a 2 \u548c14 \u7684\u4e24\u4e2a\u5ca9\u77f3\u79fb\u8d70\u540e\uff0c\u6700\u77ed\u7684\u8df3\u8dc3\u8ddd\u79bb\u4e3a 4\uff08\u4ece\u4e0e\u8d77\u70b9\u8ddd\u79bb17\u7684\u5ca9\u77f3\u8df3\u5230\u8ddd\u79bb 21\u7684\u5ca9\u77f3\uff0c\u6216\u8005\u4ece\u8ddd\u79bb 21 \u7684\u5ca9\u77f3\u8df3\u5230\u7ec8\u70b9\uff09\u3002<\/pre>\n\n\n\n
Note<\/h3>\n\n\n\n
\u5bf9\u4e8e20%\u7684\u6570\u636e\uff0c0 \u2264 M \u2264 N \u2264 10\u3002
\u5bf9\u4e8e50%\u7684\u6570\u636e\uff0c0 \u2264  M \u2264 N \u2264 100\u3002
\u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c0 \u2264 M \u2264 N \u2264 50,000\uff0c1 \u2264 L \u2264 1,000,000,000\u3002<\/pre>\n<\/blockquote>\n\n\n\n
\u5355\u8c03\u6027\u5206\u6790\uff1a<\/h3>\n\n\n\n
\n
\u5bf9\u4e8e\u4efb\u4f55\u7ed9\u5b9a\u7684\u6700\u5c0f\u8df3\u8dc3\u8ddd\u79bb x<\/code>\uff0c\u5982\u679c\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u79fb\u9664 M<\/code> \u5757\u5ca9\u77f3\u6765\u4f7f\u5f97\u6700\u77ed\u8df3\u8dc3\u8ddd\u79bb\u81f3\u5c11\u4e3a x<\/code>\uff0c\u90a3\u4e48\u5bf9\u4e8e\u4efb\u4f55\u66f4\u5c0f\u7684\u8df3\u8dc3\u8ddd\u79bb x' < x<\/code>\uff0c\u6211\u4eec\u4e5f\u80af\u5b9a\u53ef\u4ee5\u901a\u8fc7\u79fb\u9664\u4e0d\u8d85\u8fc7 M<\/code> \u5757\u5ca9\u77f3\u4f7f\u5f97\u6700\u77ed\u8df3\u8dc3\u8ddd\u79bb\u81f3\u5c11\u4e3a x'<\/code>\u3002\u4e5f\u5c31\u662f\u8bf4\uff0c\u5982\u679c\u6211\u4eec\u80fd\u591f\u5b9e\u73b0\u67d0\u4e2a\u8df3\u8dc3\u8ddd\u79bb x<\/code>\uff0c\u5219\u6240\u6709\u5c0f\u4e8e x<\/code> \u7684\u8df3\u8dc3\u8ddd\u79bb\u4e5f\u662f\u53ef\u884c\u7684\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e6;\nint  l,n,m;\nint d[MAXN];\nint check(int x){\n    int ans = 0;\n    int last = 0;\n    for(int i = 1;i <= n;i++){\n        \/\/ \u5982\u679c\u5f53\u524d\u5ca9\u77f3\u4e0e\u4e0a\u4e00\u4e2a\u5ca9\u77f3\u7684\u8ddd\u79bb\u5c0f\u4e8e x\uff0c\u6211\u4eec\u5c31\u9700\u8981\u79fb\u9664\u8fd9\u4e2a\u5ca9\u77f3\n        if(d[i] - last < x) ans++;\n            else last = d[i];\n    }\n    \/\/ \u5982\u679c\u79fb\u9664\u7684\u5ca9\u77f3\u6570\u91cf\u8d85\u8fc7 M\uff0c\u8bf4\u660e\u8df3\u8dc3\u8ddd\u79bb x \u4e0d\u53ef\u80fd\u6210\u7acb\n    if(ans > m) return 0;\n    else return 1;\n    \n}\nint main(){\n    \n    \/\/\u4e8c\u5206\u6700\u77ed\u8df3\u8dc3\u8ddd\u79bb\n    int left,right,mid;\n    cin >> l >> n >> m;\n    left = 1,right = l;\n    for(int i = 1;i <= n;++i){\n        cin >> d[i];\n    }\n    while(left < right){\n        mid = (left + right + 1) \/ 2;\n        if(check(mid)) left = mid;\n        else right = mid - 1;\n    }\n    cout << left << \"\\n\";\n    return 0;\n}<\/code><\/pre>\n\n\n\n
G – \u94f6\u884c\u8d37\u6b3e<\/a><\/h2>\n\n\n\n
\n
Description<\/h3>\n\n\n\n
\u5f53\u4e00\u4e2a\u4eba\u4ece\u94f6\u884c\u8d37\u6b3e\u540e\uff0c\u5728\u4e00\u6bb5\u65f6\u95f4\u5185\u4ed6\uff08\u5979\uff09\u5c06\u4e0d\u5f97\u4e0d\u6bcf\u6708\u507f\u8fd8\u56fa\u5b9a\u7684\u5206\u671f\u4ed8\u6b3e\u3002\u8fd9\u4e2a\u95ee\u9898\u8981\u6c42\u8ba1\u7b97\u51fa\u8d37\u6b3e\u8005\u5411\u94f6\u884c\u652f\u4ed8\u7684\u5229\u7387\u3002\u5047\u8bbe\u5229\u7387\u6309\u6708\u7d2f\u8ba1\u3002<\/p>\n\n\n\n
Input<\/h3>\n\n\n\n
\u4e09\u4e2a\u7528\u7a7a\u683c\u9694\u5f00\u7684\u6b63\u6574\u6570\u3002<\/p>\n\n\n\n
\u7b2c\u4e00\u4e2a\u6574\u6570\u8868\u793a\u8d37\u6b3e\u7684\u539f\u503c w0w<\/em>0\uff0c\u7b2c\u4e8c\u4e2a\u6574\u6570\u8868\u793a\u6bcf\u6708\u652f\u4ed8\u7684\u5206\u671f\u4ed8\u6b3e\u91d1\u989d ww<\/em>\uff0c\u7b2c\u4e09\u4e2a\u6574\u6570\u8868\u793a\u5206\u671f\u4ed8\u6b3e\u8fd8\u6e05\u8d37\u6b3e\u6240\u9700\u7684\u603b\u6708\u6570 mm<\/em>\u3002<\/p>\n\n\n\n
Output<\/h3>\n\n\n\n
\u4e00\u4e2a\u5b9e\u6570\uff0c\u8868\u793a\u8be5\u8d37\u6b3e\u7684\u6708\u5229\u7387\uff08\u7528\u767e\u5206\u6570\u8868\u793a\uff09\uff0c\u56db\u820d\u4e94\u5165\u7cbe\u786e\u5230 0.1%0.1%\u3002<\/p>\n\n\n\n
\u6570\u636e\u4fdd\u8bc1\u7b54\u6848\u4e0d\u8d85\u8fc7 300.0%300.0%\u3002<\/p>\n\n\n\n
Sample 1<\/h3>\n\n\n\n
Inputcopy<\/th>Outputcopy<\/th><\/tr><\/thead>
1000 100 12<\/code><\/td>2.9<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
Hint<\/h3>\n\n\n\n
\u6570\u636e\u4fdd\u8bc1\uff0c1\u2264w0,w\u2264231\u221211\u2264w<\/em>0,w<\/em>\u2264231\u22121\uff0c1\u2264m\u226430001\u2264m<\/em>\u22643000\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main() {\n    double w0,w,m;\n    cin >> w0 >> w >> m;\n    double l = 0.0,r = 100000.0;\n    while(r - l > 1e-7){\n       \n        double mid = (r + l) \/ 2.0; \/\/ \u6b64\u65f6\u5047\u8bbe\u5229\u606f\u662fmid\n        double temp = w0;\n        \/\/ \u6a21\u62df\u4e00\u4e0bm\u4e2a\u6708\u4efd\n        for(int i = 1;i <= m;i++){\n            temp = temp - w + temp * (mid \/ 100);\n        }\n        if(temp > 1e-7){\n            r = mid; \/\/ \u6ca1\u8fd8\u5b8c\uff0c\u5229\u7387\u504f\u5927\n        }else{\n            l = mid; \/\/ \u8fd8\u5b8c\u4e86\uff0c\u5229\u7387\u504f\u5c0f\n        }\n    }\n    cout << fixed << setprecision(1) << l << \"\\n\";\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
NENUACM\u57f9\u8bad\u4e8c\u5206\u4e13\u9898 – Virtual Judge A – \u67e5\u627e Descri […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[19],"tags":[],"class_list":["post-409","post","type-post","status-publish","format-standard","hentry","category-19"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/409","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/comments?post=409"}],"version-history":[{"count":1,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/409\/revisions"}],"predecessor-version":[{"id":410,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/409\/revisions\/410"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=409"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=409"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=409"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}