\u6613\u77e5\uff0c\u6700\u540e\u4e00\u5b9a\u662f\u6d88\u6210 [1,2,…,b] \u8fd9\u6837\u7684\u60c5\u51b5\uff0c\u7136\u540e\u4e00\u6b21\u8fde\u9501\u64cd\u4f5c\u5168\u90e8\u5220\u9664\uff08\u597d\u50cf\u7089\u77f3\u91cc\u6709\u5f20\u7c7b\u4f3c\u7684\u5361\uff09\u3002
\n\u5bf9\u4e8e\u53ea\u9700\u8981\u5904\u7406\u4e00\u6b21\u8be2\u95ee\u7684\u60c5\u51b5\uff0c\u6211\u4eec\u53ef\u4ee5\u76f4\u63a5\u5bf9 a \u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\uff0c\u7136\u540e\u8d2a\u5fc3\u5f97\u5230\u6700\u540e\u7684 b \u5373\u53ef\u3002<\/p>\n
\r\nconst int N = int(2e5) + 9;\r\nint a[N];\r\nint n;\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n\tRush {\r\n RD(n); REP(i, n) RD(a[i]);\r\n LL s = 0, b = 0; sort(a, a+n);\r\n REP(i, n) if (a[i] > b) s += a[i] - ++b;\r\n cout << s << endl;\r\n\t}\r\n}\r\n<\/pre>\nProblem B. Letter Exchange<\/h2>\n
\u5206\u60c5\u51b5\u8ba8\u8bba\uff0c\u8d2a\u5fc3\u4e00\u4e0b\u5373\u53ef\uff08\u8bc1\u660e\u611f\u89c9\u53ef\u4ee5\u7c7b\u6bd4\u6392\u5217\u7684\u5faa\u73af\u5206\u89e3\uff09\u3002<\/p>\n
Problem C. Monsters (hard version)<\/h2>\n
\u7b2c\u4e00\u60f3\u6cd5\uff0c\u867d\u7136\u73b0\u5728\u65e0\u6cd5\u6392\u5e8f\u4e86\uff0c\u4f46\u662f\u603b\u80fd\u7528\u5e73\u8861\u6811\u53bb\u7ef4\u62a4\u7684\uff0c\u53c8\u56e0\u4e3a a \u7684\u503c\u57df\u5f88\u5c0f\uff0c\u56e0\u6b64\u7528\u7ebf\u6bb5\u6811\u6216\u8005\u6811\u72b6\u6570\u7ec4\u4e00\u5b9a\u4f1a\u662f\u66f4\u597d\u7684\u9009\u62e9\uff0c\u5177\u4f53\u9700\u8981\u7ef4\u62a4\u4ec0\u4e48\uff0c\u9700\u8981\u8fdb\u4e00\u6b65\u5206\u6790\u3002<\/p>\n
\u6bcf\u6b21\u52a0\u5165\u4e00\u4e2a\u65b0\u7684\u6570\uff0c\u6211\u4eec\u4f9d\u7136\u9700\u8981\u5206\u60c5\u51b5\u8ba8\u8bba\uff0c\u7b2c\u4e00\u79cd\u662f a[i] > b \u7684\u60c5\u51b5\uff0c\u90a3\u4e48\u4f9d\u7136\u53ef\u4ee5 ++b\u3002
\n\u7b2c\u4e8c\u79cd a[i] <= b \u7684\u60c5\u51b5\uff0c\u8fd9\u79cd\u60c5\u51b5\u770b\u8d77\u6765\u6bd4\u8f83\u590d\u6742\uff0c\u6211\u4eec\u9700\u8981\u627e\u4e00\u4e2a\u6570\u8fdb\u884c\u66ff\u6362\uff0c\u5e76\u91cd\u65b0\u8c03\u6574\u5f53\u524d\u7684\u7b54\u6848\u3002
\nbut wait… a[i] <= b \u7684\u60c5\u51b5\uff0cb \u5c31\u4e00\u5b9a\u4e0d\u4f1a\u589e\u52a0\u4e86\u5417\uff1f<\/p>\n
\u7b54\u6848\u662f\u5426\u5b9a\u7684\uff0c\u6bd4\u5982\u6211\u4eec\u770b 1,1 \u548c 2,1 … \u5728\u7b2c\u4e8c\u8f6e\uff0c\u867d\u7136 1 \u90fd\u6ee1\u8db3 a[i] <= b\uff0c\u4f46\u662f\u524d\u8005 b \u4e0d\u4f1a\u88ab\u66f4\u65b0\uff0c\u800c\u540e\u8005 b \u4f9d\u7136\u8981\u66f4\u65b0\u3002
\n\u56e0\u6b64\u6211\u4eec\u53d1\u73b0\u8fd9\u91cc\u7528 a[i] > b \u5f53\u505a\u5224\u5b9a\u6761\u4ef6\u5e76\u4e0d\u662f\u6700\u5408\u9002\u7684\u3002<\/p>\n
\u4e8b\u5b9e\u4e0a\u6211\u4eec\u6709\u66f4\u5f3a\u7684\u6761\u4ef6\uff0c\u6bcf\u4e00\u8f6e\u6b21\u6211\u4eec\u7ebf\u6bb5\u6811\u7684\u5185\u90e8\u90fd\u662f\u5728\u548c [1,2,…,b] \u8fd9\u4e2a\u5e8f\u5217\u8fdb\u884c\u6bd4\u8f83\uff0c\u5e76\u4e14\u65f6\u523b\u8981\u4fdd\u8bc1\u5b83\u7684\u6bcf\u4e2a\u524d\u7f00\u4e0d\u80fd\u6bd4\u8f83\u7684\u65f6\u5019\u4f7f\u7528\u4e86\u66f4\u591a\u7684\u6570\uff0c
\n\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u5c06\u7ebf\u6bb5\u6811\u521d\u59cb\u5316\u4e3a [-1, -1, -1, …, -1]\uff0c\u7136\u540e\u4fdd\u8bc1\u4efb\u610f\u65f6\u523b\u524d\u7f00\u548c <= 0 \u5373\u53ef\uff0c\u4e5f\u5c31\u662f\u652f\u6301\uff1a<\/p>\n
\n- \u5355\u70b9\u4fee\u6539\u3002<\/li>\n
- \u67e5\u8be2\u524d\u7f00\u548c\u6700\u65e9 > 0 \u7684\u4f4d\u7f6e\u3002<\/li>\n<\/ol>\n
\u8fd9\u4e2a\u67e5\u8be2\u51fa\u7684\u4f4d\u7f6e\uff0c\u5c31\u662f\u4e0a\u9762\u6240\u8bf4\u7684\u88ab\u66ff\u6362\u51fa\u7684\u6570\uff0c\u6211\u4eec\u7528\u5b83\u8c03\u6574\u7b54\u6848\u5373\u53ef\u3002
\n\uff08\u8fd9\u4e2a\u64cd\u4f5c\u4f3c\u4e4e\u4e5f\u662f\u53ef\u4ee5\u6811\u72b6\u6570\u7ec4\u7684\uff0c\u6211\u4e0d\u4f1a >_<\u3002\uff09<\/p>\n
\u8fd9\u4e2a\u505a\u6cd5\u548c\u524d\u51e0\u5929 Universal Cup \u7684 E \u9898\u5f88\u50cf\u3002<\/p>\n
\r\nconst int N = int(2e5) + 9;\r\nint a[N];\r\nint n;\r\n \r\nint ss[4*N], mx[4*N];\r\n \r\n#define lx (x<<1)\r\n#define rx (lx|1)\r\n#define ml ((l+r)>>1)\r\n#define mr (ml+1)\r\n#define lc lx,l,ml\r\n#define rc rx,mr,r\r\n#define rt 1,1,n\r\n \r\nvoid upd(int x) {\r\n ss[x] = ss[lx] + ss[rx];\r\n mx[x] = max(mx[lx], ss[lx] + mx[rx]);\r\n}\r\n \r\nvoid Build(int x, int l, int r) {\r\n ss[x] = mx[x] = -1;\r\n if (l < r) {\r\n Build(lc); Build(rc);\r\n upd(x);\r\n }\r\n}\r\n \r\nint Query(int x, int l, int r, int k) {\r\n if (l == r) return l;\r\n return mx[lx] > k ? Query(lc, k) : Query(rc, k-ss[lx]);\r\n}\r\n \r\nvoid Add(int x, int l, int r, int a, int d) {\r\n if (l == r) {\r\n ss[x] += d; mx[x] += d;\r\n } else {\r\n if (a < mr) Add(lc, a, d);\r\n else Add(rc, a, d);\r\n upd(x);\r\n }\r\n}\r\n \r\nint main(){\r\n \r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n#endif\r\n \r\n\tRush {\r\n RD(n); Build(rt); LL s = 0; int b = 0;\r\n REP(i, n) {\r\n int a; s += RD(a); Add(rt, a, 1);\r\n if (mx[1] <= 0) {\r\n s -= ++b;\r\n } else {\r\n int x = Query(rt, 0);\r\n Add(rt, x, -1);\r\n s -= x;\r\n }\r\n printf("%lld ", s);\r\n }\r\n puts("");\r\n\t}\r\n}\r\n \r\n\/\/ \u5355\u70b9\u4fee\u6539\r\n\/\/ \u67e5\u8be2\u524d\u7f00\u548c\u6700\u65e9 > 0 \u7684\u4f4d\u7f6e\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Problem A. Monsters (easy version) \u6613\u77e5\uff0c\u6700\u540e\u4e00\u5b9a\u662f\u6d88\u6210 [1,2,…,b] \u8fd9\u6837\u7684\u60c5\u51b5\uff0c\u7136\u540e\u4e00\u6b21\u8fde\u9501\u64cd\u4f5c\u5168\u90e8\u5220\u9664\uff08\u597d\u50cf\u7089\u77f3\u91cc\u6709\u5f20\u7c7b\u4f3c\u7684\u5361\uff09\u3002 \u5bf9\u4e8e\u53ea\u9700\u8981\u5904\u7406\u4e00\u6b21\u8be2\u95ee\u7684\u60c5\u51b5\uff0c\u6211\u4eec\u53ef\u4ee5\u76f4\u63a5\u5bf9 a \u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\uff0c\u7136\u540e\u8d2a\u5fc3\u5f97\u5230\u6700\u540e\u7684 b \u5373\u53ef\u3002 const int N = int(2e5) + 9; int a[N]; int n; int main(){ #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); #endif Rush { RD(n); REP(i, n) RD(a[i]); LL s = 0, b = 0; sort(a, a+n); REP(i, n) if (a[i] > b) s += […]<\/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-2278","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-AK","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2278","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=2278"}],"version-history":[{"count":16,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2278\/revisions"}],"predecessor-version":[{"id":2294,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2278\/revisions\/2294"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=2278"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=2278"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=2278"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}