{"id":116,"date":"2024-02-06T14:47:17","date_gmt":"2024-02-06T06:47:17","guid":{"rendered":"https:\/\/linxce.ink\/?p=116"},"modified":"2024-02-06T14:49:15","modified_gmt":"2024-02-06T06:49:15","slug":"%e7%ba%bf%e6%ae%b5%e6%a0%91%e6%a8%a1%e6%9d%bf","status":"publish","type":"post","link":"https:\/\/linxce.ink\/index.php\/%e7%ba%bf%e6%ae%b5%e6%a0%91%e6%a8%a1%e6%9d%bf\/%e5%85%a8%e9%83%a8\/acm\/","title":{"rendered":"\u7ebf\u6bb5\u6811\u6a21\u677f"},"content":{"rendered":"

\u26a0 \u5355\u70b9\u4fee\u6539\uff0c\u533a\u95f4\u67e5\u8be2 \u548c \u533a\u95f4\u4fee\u6539\uff0c\u533a\u95f4\u67e5\u8be2 \u7684\u51fd\u6570\u522b\u6df7\u7528\uff08\u4e00\u4e2a\u5e26mark\uff0c\u4e00\u4e2a\u4e0d\u5e26\uff09<\/h3>\n
int tree[N], sum[N << 2], mi[N << 2], ma[N << 2];\r\nvoid build(int k, int l, int r) \/\/ k\u8868\u793a\u5f53\u524d\u7ed3\u70b9\u7684\u7f16\u53f7\uff0cl,r\u4e3a\u5f53\u524d\u7ed3\u70b9\u6240\u4ee3\u8868\u7684\u533a\u95f4\r\n{\r\n    if (l == r) \/\/ \u5f53\u524d\u7ed3\u70b9\u4e3a\u53f6\u5b50\u7ed3\u70b9\r\n    {\r\n        sum[k] = ma[k] = mi[k] = tree[l]; \/\/ \u5bf9\u5e94\u533a\u95f4\u7684\u6700\u5c0f\u503c\u4e3a\u539f\u5e8f\u5217\u4e2d\u7684\u5bf9\u5e94\u503c\r\n        return;\r\n    }\r\n    int mid = l + r >> 1;\r\n    build(k << 1, l, mid);                  \/\/ \u6784\u9020\u5de6\u5b50\u6811\r\n    build(k << 1 | 1, mid + 1, r);          \/\/ \u6784\u9020\u53f3\u5b50\u6811\r\n    sum[k] = sum[k << 1] + sum[k << 1 | 1]; \/\/ \u66f4\u65b0\r\n    mi[k] = min(mi[k << 1], mi[k << 1 | 1]);\r\n    ma[k] = max(ma[k << 1], ma[k << 1 | 1]);\r\n}\r\n\/*\u5355\u70b9\u4fee\u6539\uff0c\u533a\u95f4\u67e5\u8be2*\/\r\nvoid change(int k, int l, int r, int x, int v) \/\/ x\u4e3a\u539f\u5e8f\u5217\u7684\u4f4d\u7f6e\uff0cv\u4e3a\u8981\u6539\u6210\u7684\u503c\r\n{\r\n    if (r < x || l > x) return;         \/\/ \u5f53\u524d\u533a\u95f4\u4e0e\u539f\u5e8f\u5217\u7684\u4f4d\u7f6e\u5b8c\u5168\u65e0\u4ea4\u96c6\r\n    if (l == r && l == x) \t\t\t\t\/\/ \u5f53\u524d\u7ed3\u70b9\u4e3a\u5bf9\u5e94\u7684\u53f6\u5b50\u7ed3\u70b9\r\n    {\r\n        sum[k] = ma[k] = mi[k] = tree[l] = v; \/\/ \u4fee\u6539\u53f6\u5b50\u7ed3\u70b9\r\n        return;\r\n    }\r\n    int mid = l + r >> 1;\r\n    change(k << 1, l, mid, x, v);           \/\/ \u4fee\u6539\u5de6\u5b50\u533a\u95f4\r\n    change(k << 1 | 1, mid + 1, r, x, v);   \/\/ \u4fee\u6539\u53f3\u5b50\u533a\u95f4\r\n    sum[k] = sum[k << 1] + sum[k << 1 | 1]; \/\/ \u66f4\u65b0\r\n    mi[k] = min(mi[k << 1], mi[k << 1 | 1]);\r\n    ma[k] = max(ma[k << 1], ma[k << 1 | 1]);\r\n}\r\nint queryA(int k, int l, int r, int x, int y) \/\/ \u533a\u95f4\u67e5\u8be2:\u533a\u95f4\u548c,\u4e0d\u5e26\u6807\u8bb0\r\n{\r\n    if (y < l || x > r) \r\n        return 0;\r\n    if (l >= x && r <= y) \r\n        return sum[k]; \/\/ \u67e5\u8be2\u6700\u503c\u4fee\u6539\u4e00\u4e0b\r\n    int mid = l + r >> 1;\r\n    return queryA(k << 1, l, mid, x, y) + queryA(k << 1 | 1, mid + 1, r, x, y);\r\n    \/\/ return min(queryA(k << 1, l, mid, x, y), queryA(k << 1 | 1, mid + 1, r, x, y));\r\n    \/\/ return max(queryA(k << 1, l, mid, x, y), queryA(k << 1 | 1, mid + 1, r, x, y));\r\n}\r\n\/*\u533a\u95f4\u4fee\u6539\uff0c\u533a\u95f4\u67e5\u8be2*\/\r\nint mark[N << 2];\r\nvoid add(int k, int l, int r, int v) \/\/ \u7ed9\u533a\u95f4[l,r]\u6240\u6709\u6570\u52a0\u4e0av\r\n{\r\n    mark[k] += v;              \/\/ \u6253\u6807\u8bb0\r\n    sum[k] += (r - l + 1) * v; \/\/ \u7ef4\u62a4\u533a\u95f4\u548c\r\n    mi[k] += v;\r\n    ma[k] += v;\r\n}\r\nvoid pushdown(int k, int l, int r, int mid) \/\/ \u6807\u8bb0\u4e0b\u4f20\r\n{\r\n    if (!mark[k]) return;                 \/\/ \u6ca1\u6709\u6807\u8bb0\u5219\u4e0d\u7528\u8003\u8651\r\n    add(k << 1, l, mid, mark[k]);         \/\/ \u4e0b\u4f20\u5230\u5de6\u5b50\u6811\r\n    add(k << 1 | 1, mid + 1, r, mark[k]); \/\/ \u4e0b\u4f20\u5230\u53f3\u5b50\u6811\r\n    mark[k] = 0;                          \/\/ \u6e05\u96f6\r\n}\r\nvoid modify(int k, int l, int r, int x, int y, int v) \/\/ \u7ed9\u5b9a\u533a\u95f4[x,y]\u6240\u6709\u6570\u52a0\u4e0av\r\n{\r\n    if (l >= x && r <= y)\r\n        return add(k, l, r, v);\r\n    int mid = l + r >> 1;\r\n    pushdown(k, l, r, mid); \/\/ \u5230\u8fbe\u6bcf\u4e00\u4e2a\u7ed3\u70b9\u90fd\u8981\u4e0b\u4f20\u6807\u8bb0\r\n    if (x <= mid) \r\n        modify(k << 1, l, mid, x, y, v);\r\n    if (mid < y)  \r\n        modify(k << 1 | 1, mid + 1, r, x, y, v);\r\n    sum[k] = sum[k << 1] + sum[k << 1 | 1]; \/\/ \u4e0b\u4f20\u540e\u66f4\u65b0\r\n    mi[k] = min(mi[k << 1], mi[k << 1 | 1]);\r\n    ma[k] = max(ma[k << 1], ma[k << 1 | 1]);\r\n}\r\nint queryB(int k, int l, int r, int x, int y) \/\/ \u8be2\u95ee\u533a\u95f4[x,y]\u7684\u548c,\u5e26\u6807\u8bb0\r\n{\r\n    if (l >= x && r <= y) \r\n        return sum[k];\r\n    int mid = l + r >> 1, res = 0;\r\n    pushdown(k, l, r, mid); \/\/ \u4e0b\u4f20\u6807\u8bb0\r\n    \/\/ \u67e5\u8be2\u6700\u503c\u4fee\u6539\u4e00\u4e0b, \u8bb0\u5f97res = +-inf;\r\n    if (x <= mid) \r\n        res += queryB(k << 1, l, mid, x, y);\r\n    if (mid < y)  \r\n        res += queryB(k << 1 | 1, mid + 1, r, x, y);\r\n    return res;\r\n}\r\n<\/code><\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
\u26a0 \u5355\u70b9\u4fee\u6539\uff0c\u533a\u95f4\u67e5\u8be2 \u548c \u533a\u95f4...<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[7,17],"class_list":["post-116","post","type-post","status-publish","format-standard","hentry","category-acm","tag-cpp","tag-17"],"_links":{"self":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/116","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/comments?post=116"}],"version-history":[{"count":3,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/116\/revisions"}],"predecessor-version":[{"id":121,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/116\/revisions\/121"}],"wp:attachment":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/media?parent=116"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/categories?post=116"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/tags?post=116"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}