{"id":148,"date":"2024-03-08T16:50:39","date_gmt":"2024-03-08T08:50:39","guid":{"rendered":"https:\/\/linxce.ink\/?p=148"},"modified":"2024-03-21T18:03:32","modified_gmt":"2024-03-21T10:03:32","slug":"%e4%b9%98%e6%b3%95%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\/%e4%b9%98%e6%b3%95%e7%ba%bf%e6%ae%b5%e6%a0%91%e6%a8%a1%e6%9d%bf\/%e5%85%a8%e9%83%a8\/acm\/","title":{"rendered":"\u4e58\u6cd5\u7ebf\u6bb5\u6811\u6a21\u677f"},"content":{"rendered":"<h3>\u4f60\u4eec\u6709\u8fd9\u6837\u7684\u7ebf\u6bb5\u6811\u5417\uff0c\u771f\u53c8\u52a0\u52a0\u53c8\u4e58\u4e58\u554a<\/h3>\n<pre><code class=\"language-cc\" lang=\"cc\">ll tree[N], sum[N &lt;&lt; 2], mark[N &lt;&lt; 2], murk[N &lt;&lt; 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    murk[k] = 1;\r\n    if (l == r) \/\/ \u5f53\u524d\u7ed3\u70b9\u4e3a\u53f6\u5b50\u7ed3\u70b9\r\n    {\r\n        sum[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 &gt;&gt; 1;\r\n    build(k &lt;&lt; 1, l, mid);                          \/\/ \u6784\u9020\u5de6\u5b50\u6811\r\n    build(k &lt;&lt; 1 | 1, mid + 1, r);                  \/\/ \u6784\u9020\u53f3\u5b50\u6811\r\n    sum[k] = (sum[k &lt;&lt; 1] + sum[k &lt;&lt; 1 | 1]) % mod; \/\/ \u66f4\u65b0\r\n}\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] = (mark[k] + v) % mod; \/\/ \u6253\u6807\u8bb0\r\n}\r\nvoid mul(int k, int l, int r, int v) \/\/ \u7ed9\u533a\u95f4[l,r]\u6240\u6709\u6570\u4e58\u4e0av\r\n{\r\n    murk[k] = murk[k] * v % mod; \/\/ \u6253\u6807\u8bb0\r\n    mark[k] = mark[k] * v % mod;\r\n}\r\nvoid pushdown(int k, int l, int r, int mid) \/\/ \u6807\u8bb0\u4e0b\u4f20\r\n{\r\n    sum[k &lt;&lt; 1] = (sum[k &lt;&lt; 1] * murk[k] + mark[k] * (mid - l + 1)) % mod;\r\n    sum[k &lt;&lt; 1 | 1] = (sum[k &lt;&lt; 1 | 1] * murk[k] + mark[k] * (r - mid)) % mod;\r\n    mul(k &lt;&lt; 1, l, mid, murk[k]);\r\n    mul(k &lt;&lt; 1 | 1, mid + 1, r, murk[k]);\r\n    add(k &lt;&lt; 1, l, mid, mark[k]);\r\n    add(k &lt;&lt; 1 | 1, mid + 1, r, mark[k]);\r\n    mark[k] = 0;\r\n    murk[k] = 1;\r\n}\r\nvoid modify_mul(int k, int l, int r, int x, int y, int v) \/\/ \u7ed9\u5b9a\u533a\u95f4[x,y]\u6240\u6709\u6570\u4e58\u4e0av\r\n{\r\n    if (x &lt;= l &amp;&amp; r &lt;= y)\r\n    {\r\n        sum[k] = sum[k] * v % mod;\r\n        return mul(k, l, r, v);\r\n    }\r\n    int mid = l + r &gt;&gt; 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 &lt;= mid)\r\n        modify_mul(k &lt;&lt; 1, l, mid, x, y, v);\r\n    if (mid &lt; y)\r\n        modify_mul(k &lt;&lt; 1 | 1, mid + 1, r, x, y, v);\r\n    sum[k] = (sum[k &lt;&lt; 1] + sum[k &lt;&lt; 1 | 1]) % mod;\r\n}\r\nvoid modify_add(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 (x &lt;= l &amp;&amp; r &lt;= y)\r\n    {\r\n        sum[k] = (sum[k] + (r - l + 1) * v) % mod;\r\n        return add(k, l, r, v);\r\n    }\r\n    int mid = l + r &gt;&gt; 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 &lt;= mid)\r\n        modify_add(k &lt;&lt; 1, l, mid, x, y, v);\r\n    if (mid &lt; y)\r\n        modify_add(k &lt;&lt; 1 | 1, mid + 1, r, x, y, v);\r\n    sum[k] = (sum[k &lt;&lt; 1] + sum[k &lt;&lt; 1 | 1]) % mod;\r\n}\r\nll query(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 (x &lt;= l &amp;&amp; r &lt;= y)\r\n        return sum[k];\r\n    ll mid = l + r &gt;&gt; 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 &lt;= mid)\r\n        res += query(k &lt;&lt; 1, l, mid, x, y);\r\n    if (mid &lt; y)\r\n        res += query(k &lt;&lt; 1 | 1, mid + 1, r, x, y);\r\n    return res % mod;\r\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u4f60\u4eec\u6709\u8fd9\u6837\u7684\u7ebf\u6bb5\u6811\u5417\uff0c\u771f\u53c8\u52a0\u52a0\u53c8&#46;&#46;&#46;<\/p>\n","protected":false},"author":1,"featured_media":139,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,18],"tags":[21,7,17],"class_list":["post-148","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-acm","category-18","tag-acm","tag-cpp","tag-17"],"_links":{"self":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/148","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=148"}],"version-history":[{"count":2,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/148\/revisions"}],"predecessor-version":[{"id":287,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/posts\/148\/revisions\/287"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/media\/139"}],"wp:attachment":[{"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/media?parent=148"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/categories?post=148"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/linxce.ink\/index.php\/wp-json\/wp\/v2\/tags?post=148"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}