{"id":200,"date":"2019-08-13T11:20:03","date_gmt":"2019-08-13T03:20:03","guid":{"rendered":"https:\/\/blog.chtholly.moe\/?p=200"},"modified":"2021-08-21T18:13:29","modified_gmt":"2021-08-21T10:13:29","slug":"%e7%ba%bf%e6%ae%b5%e6%a0%91","status":"publish","type":"post","link":"https:\/\/blog.sukasuka.cn\/?p=200","title":{"rendered":"\u7ebf\u6bb5\u6811"},"content":{"rendered":"<p><strong>\u7ebf\u6bb5\u6811<\/strong>(Segment Tree),\u4e00\u79cd\u57fa\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6570\u636e\u7ed3\u6784\uff0c\u901a\u8fc7\u5c06\u5b50\u95ee\u9898\u8fdb\u884c\u7b80\u5355\u7684\u5408\u5e76\u4ece\u800c\u9ad8\u6548\u5730\u89e3\u51b3\u95ee\u9898(log2)<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/blog.sukasuka.cn\/wp-content\/uploads\/2019\/08\/segtree_graph-300x300.png\" alt=\"\" \/><\/p>\n<h2>\u00a0\u7528\u7ed3\u6784\u4f53\u5b58\u50a8\u7ebf\u6bb5\u6811<\/h2>\n<pre><code class=\"language-cpp\">const int MAXN=100000;\/\/\u8282\u70b9\u6570\nint sav[MAXN+1];\/\/\u5b58\u50a8\u521d\u59cb\u503c\nint Mod,N,M;\nstruct node {\n    int val,plus,times;\/\/plus\u5b58\u50a8\u52a0\u6cd5lazytag,times\u5b58\u4e58\u6cd5\n} a[4*MAXN+1];<\/code><\/pre>\n<h3>\u00a0\u5efa\u7acb\u4e00\u68f5\u6811(\u5de6\u53f3\u513f\u5b50\u9012\u5f52)<\/h3>\n<pre><code class=\"language-cpp\">void build(int k,int l,int r) {\n    a[k].times=1;\n    a[k].plus=0;\n    if(l==r) {\n        a[k].val=sav[l]%Mod;\n        return;\n    }\n    int mid=(l+r)&gt;&gt;1;\/\/\u4e0d\u8981\u6253\u9519&gt;&gt;\u548cl,r\n    build(k&lt;&lt;1,l,mid);\n    build((k&lt;&lt;1)+1,mid+1,r);\n    a[k].val=(a[k&lt;&lt;1].val+a[(k&lt;&lt;1)+1].val)%Mod;\/\/\u5efa\u5b8c\u6811\u8981\u66f4\u65b0\u5f53\u524d\u8282\u70b9\u7684\u503c=(\u5de6\u513f\u5b50+\u53f3\u513f\u5b50)\n    return;\n}<\/code><\/pre>\n<h3>\u00a0\u203blazytag\u4e0b\u4f20\u64cd\u4f5c<\/h3>\n<pre><code class=\"language-cpp\">void pushdown(int k,int l,int r) {\n    int mid=(l+r)&gt;&gt;1;\n    a[k&lt;&lt;1].val=(a[k&lt;&lt;1].val*a[k].times+a[k].plus*(mid-l+1))%Mod;\n    a[(k&lt;&lt;1)+1].val=(a[(k&lt;&lt;1)+1].val*a[k].times+a[k].plus*(r-mid))%Mod;\n        \/\/\u66f4\u6539\u5de6\u53f3\u513f\u5b50\u7684\u503c,\u6ce8\u610f(mid-l+1)\u4e0e(r-mid)\n        a[k&lt;&lt;1].times=a[k].times*a[k&lt;&lt;1].times%Mod;\n    a[(k&lt;&lt;1)+1].times=a[k].times*a[(k&lt;&lt;1)+1].times%Mod;\n    a[k&lt;&lt;1].plus=(a[k&lt;&lt;1].plus*a[k].times+a[k].plus)%Mod;\n    a[(k&lt;&lt;1)+1].plus=(a[(k&lt;&lt;1)+1].plus*a[k].times+a[k].plus)%Mod;\n        \/\/\u66f4\u6539\u5de6\u53f3\u513f\u5b50\u7684lazytag,\u6ce8\u610f\u5148\u4e58\u9664\u518d\u52a0\u51cf,\u4e58\u6cd5lazytag\u76f4\u63a5\u4e58\n        \/\/\u52a0\u6cd5lazytag\u5148\u5c06\u7236\u4eb2\u7684\u4e58\u6cd5lazytag\u5e94\u7528\u540e\u518d\u52a0\u4e0a\u7236\u4eb2\u7684\u52a0\u6cd5lazytag\n    a[k].plus=0;\n    a[k].times=1;\n    return;\n}<\/code><\/pre>\n<h3>\u00a0\u52a0\u6cd5\u66f4\u65b0\u533a\u95f4<\/h3>\n<pre><code class=\"language-cpp\">void update_add(int k,int nl,int nr,int l,int r,int val) {\n    if(nl&gt;r||nr&lt;l)return;\n    if(nr&lt;=r&amp;&amp;nl&gt;=l) {\n        a[k].plus=(a[k].plus+val)%Mod;\/\/\u76f4\u63a5\u52a0\n        a[k].val=(a[k].val+val*(nr-nl+1))%Mod;\/\/\u4e0d\u8981\u5fd8\u8bb0\u66f4\u65b0\u503c,\u6709\u591a\u5c11\u4e2a\u513f\u5b50\u5c31\u52a0\u591a\u5c11\u6b21\n        return;\n    }\n    pushdown(k,nl,nr);\/\/\u6ce8\u610f\u5148\u4e0b\u4f20\n    int mid=(nl+nr)&gt;&gt;1;\n    update_add(k&lt;&lt;1,nl,mid,l,r,val);\n    update_add((k&lt;&lt;1)+1,mid+1,nr,l,r,val);\/\/mid+1\n    a[k].val=(a[k&lt;&lt;1].val+a[(k&lt;&lt;1)+1].val)%Mod;\/\/\u4e0d\u8981\u5fd8\u8bb0\u66f4\u65b0\u503c\n    return;\n}<\/code><\/pre>\n<h3>\u00a0\u4e58\u6cd5\u66f4\u65b0\u533a\u95f4<\/h3>\n<pre><code class=\"language-cpp\">void update_mul(int k,int nl,int nr,int l,int r,int val) {\n    if(nr&lt;l||nl&gt;r)return;\n    if(nr&lt;=r&amp;&amp;nl&gt;=l) {\n        a[k].val=a[k].val*val%Mod;\/\/\u76f4\u63a5\u66f4\u65b0\n        a[k].times=a[k].times*val%Mod;\n        a[k].plus=a[k].plus*val%Mod;\n        return;\n    }\n    pushdown(k,nl,nr);\/\/\u8fd8\u662f\u5148\u4e0b\u4f20\n    int mid=(nl+nr)&gt;&gt;1;\n    update_mul(k&lt;&lt;1,nl,mid,l,r,val);\n    update_mul((k&lt;&lt;1)+1,mid+1,nr,l,r,val);\n    a[k].val=(a[k&lt;&lt;1].val+a[(k&lt;&lt;1)+1].val)%Mod;\/\/\u8fd8\u662f\u4e0d\u8981\u5fd8\u8bb0\u66f4\u65b0\u503c\n    return;\n}<\/code><\/pre>\n<h3>\u00a0\u533a\u95f4\u67e5\u8be2<\/h3>\n<pre><code class=\"language-cpp\">int query(int k,int l,int r,int target_l,int target_r) {\n    if(target_l&gt;r||target_r&lt;l)return 0;\/\/\u8d8a\u754c\n    if(target_l&lt;=l&amp;&amp;target_r&gt;=r) {\n        return a[k].val%Mod;\/\/\u5305\u542b\n    }\n    pushdown(k,l,r);\/\/\u5148\u66f4\u65b0\n    int mid=(l+r)&gt;&gt;1;\/\/\u518d\u5206\u6cbb\n    return (query(k&lt;&lt;1,l,mid,target_l,target_r)+query((k&lt;&lt;1)+1,mid+1,r,target_l,target_r))%Mod;\n}<\/code><\/pre>\n<h3>\u00a0\u7528\u6cd5<\/h3>\n<pre><code class=\"language-cpp\">build(1,1,N);\/\/\u5efa\u7acb\u4e00\u68f5\u6811\nquery(1,1,N,x,y);\/\/\u67e5\u8be2x-&gt;y\u533a\u95f4\u7684\u6570\u503c\u548c\nupdate_add(1,1,N,x,y,val)\/\/\u5c06x-&gt;y\u533a\u95f4\u52a0\u4e0a\u4e00\u4e2aval\nupdate_mul(1,1,N,x,y,val)\/\/\u5c06x-&gt;y\u533a\u95f4\u90fd\u4e58val<\/code><\/pre>\n<h3>2020.8.28 UPDATE \u6574\u5408SegmentTree<\/h3>\n<pre><code class=\"language-cpp\">struct SegTree {\n#define ls(x) (x&lt;&lt;1)\n#define rs(x) (x&lt;&lt;1)+1\n#define ll long long\n    struct node {\n        ll sum,lazy,max,min;\n        int l,r;\n    };\n    const static int MAXN = 100010;\n    node a[4*MAXN+5];\n    inline void swap(int &amp;a,int &amp;b) {\n        int c=a;\n        a=b,b=c;\n    }\n    inline ll max(ll &amp;a,ll &amp;b) {\n        return a&gt;b?a:b;\n    }\n    inline ll min(ll &amp;a,ll &amp;b) {\n        return a&gt;b?b:a;\n    }\n    inline void pushup(int &amp;k) {\n        a[k].sum=a[ls(k)].sum+a[rs(k)].sum;\n        a[k].max=max(a[ls(k)].max,a[rs(k)].max);\n        a[k].min=min(a[ls(k)].min,a[rs(k)].min);\n    }\n    inline void pushdown(int &amp;k) {\n        if(a[k].lazy==0)return;\n        a[ls(k)].sum+=a[k].lazy*(a[ls(k)].r-a[ls(k)].l+1);\n        a[rs(k)].sum+=a[k].lazy*(a[rs(k)].r-a[rs(k)].l+1);\n        a[ls(k)].lazy+=a[k].lazy,a[rs(k)].lazy+=a[k].lazy;\n        a[ls(k)].max+=a[k].lazy,a[rs(k)].max+=a[k].lazy;\n        a[ls(k)].min+=a[k].lazy,a[rs(k)].min+=a[k].lazy;\n        a[k].lazy=0;\n    }\n    void build(int k,int l,int r,ll *sav) {\n        a[k].l=l,a[k].r=r;\n        if(l==r) {\n            a[k].sum=a[k].max=a[k].min=sav[l];\n            return;\n        }\n        int mid=l+r&gt;&gt;1;\n        build(ls(k),l,mid,sav);\n        build(rs(k),mid+1,r,sav);\n        pushup(k);\n    }\n    void query(int k,int l,int r,ll &amp;dist,short op) {\n        \/*\n        op = 0 query sum\n             1 query max\n             2 query min\n        *\/\n        if(a[k].l&gt;=l&amp;&amp;a[k].r&lt;=r) {\n            if(op==0)\n                dist+=a[k].sum;\n            if(op==1)\n                dist=max(dist,a[k].max);\n            if(op==2)\n                dist=min(dist,a[k].min);\n            return;\n        }\n        pushdown(k);\n        int mid=(a[k].l+a[k].r)&gt;&gt;1;\n        if(l&lt;=mid)query(ls(k),l,r,dist,op);\n        if(r&gt;mid)query(rs(k),l,r,dist,op);\n    }\n    void add(int k,int l,int r,ll &amp;x) {\n        if(a[k].l&gt;=l&amp;&amp;a[k].r&lt;=r) {\n            a[k].sum+=x*(a[k].r-a[k].l+1);\n            a[k].max+=x,a[k].min+=x;\n            a[k].lazy+=x;\n            return;\n        }\n        pushdown(k);\n        int mid=(a[k].r+a[k].l)&gt;&gt;1;\n        if(l&lt;=mid)add(ls(k),l,r,x);\n        if(r&gt;mid)add(rs(k),l,r,x);\n        pushup(k);\n    }\n} T;<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u7ebf\u6bb5\u6811(Segment Tree),\u4e00\u79cd\u57fa\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6570\u636e\u7ed3\u6784\uff0c\u901a\u8fc7\u5c06\u5b50\u95ee\u9898\u8fdb\u884c\u7b80\u5355\u7684\u5408\u5e76\u4ece\u800c\u9ad8\u6548\u5730\u89e3\u51b3\u95ee\u9898 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":500,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-200","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-cpp"],"_links":{"self":[{"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/posts\/200","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=200"}],"version-history":[{"count":7,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/posts\/200\/revisions"}],"predecessor-version":[{"id":502,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/posts\/200\/revisions\/502"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=\/wp\/v2\/media\/500"}],"wp:attachment":[{"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=200"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=200"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.sukasuka.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=200"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}