线段树区间求和

这几天在做线段树的题目，回忆一下以前的东西，同时也再进一步提高一点，结果在做一道简单的题的时候又出现了错误，调试了整整两天，找同学问了问才找到了问题所在。

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1698

just a hook

经验：要考虑怎样标记分裂和 何时分裂

 

错误源代码：

#include <stdio.h>
#define N 200010
typedef struct{
    int l, r, mid;
    int kind;
    int sum;
}NODE;
NODE nod[4 * N];
void build(int ll, int rr, int ind)
{
    nod[ind].l = ll;
    nod[ind].r = rr;
    nod[ind].kind = 1;
    if(ll == rr)
    {
        nod[ind].sum = 1;
        return ;
    }
    nod[ind].mid = (ll + rr) >> 1;
    build(ll, nod[ind].mid, ind * 2);
    build(nod[ind].mid + 1, rr, ind * 2 + 1);
    nod[ind].sum = nod[ind * 2].sum + nod[ind * 2 + 1 ].sum;
}

void update(int ll, int rr, int k, int ind)
{
    if(ll == nod[ind].l && rr == nod[ind].r)
    {
        nod[ind].kind = k;
        nod[ind].sum = k * (rr - ll + 1);
        return ;
    }
    
    //nod[ind].kind = -1;
    
    if((nod[ind].sum != nod[ind * 2].sum + nod[ind * 2 + 1].sum))
    //错误就出在这，只有当父节点被完全覆盖时，这才对，否则就会丢失修改或者改成其他的。
   // 反例：
   //  2    --test case number
  //   4    --4 hooks
  //   2    -- two operations
  //   1 1 2   -- the first hook change into 2
  //   2 4 2   --  the last 3 hooks change into 2
  //另一个好例子：
  /*
   40
   4
   4
    2 2 3
    3 4 2
    1 4 2
    1 1  3
*/

 {
        nod[ind * 2].kind = nod[ind].kind;
        nod[ind * 2 + 1].kind = nod[ind].kind;

        nod[ind * 2].sum = nod[ind].kind * (nod[ind * 2].r - nod[ind * 2].l + 1);
        nod[ind * 2 + 1].sum = nod[ind].kind * (nod[ind * 2 + 1].r - nod[ind * 2 + 1].l + 1);
        //nod[ind] = -1;
    }

    if(rr <= nod[ind].mid)
    {
        update(ll, rr, k, ind * 2);
    }
    else if(ll > nod[ind].mid)
        update(ll, rr, k, ind * 2 + 1);
    else
    {
        update(ll, nod[ind].mid, k, ind * 2);
        update(nod[ind].mid + 1, rr, k, ind * 2 + 1);
    }
    nod[ind].sum = nod[ind * 2].sum + nod[ind * 2 + 1].sum;
}
int main()
{
    int tc;
    int n;
    int i, j;
    int x, y, k, q;

    while(scanf("%d", &tc) == 1)
    {
        for(j = 1; j <= tc; j++)
        {
            scanf("%d", &n);
            build(1, n, 1);
            scanf("%d", &q);
            for(i = 0; i < q; i++)
            {
                scanf("%d%d%d", &x, &y, &k);
                if(x > y)
                {
                    int t = x;
                    x = y;
                    y = t;
                }
                update(x, y, k, 1);
            }
            printf("Case %d: The total value of the hook is %d.\n", j, nod[1].sum);
        }
    }
    return 0;
}

 

正确代码：

#include <stdio.h>
#define N 200010
typedef struct{
    int l, r, mid;
    int kind;
    int sum;
}NODE;
NODE nod[4 * N];
void build(int ll, int rr, int ind)
{
    nod[ind].l = ll;
    nod[ind].r = rr;
    nod[ind].kind = 1;
    if(ll == rr)
    {
        nod[ind].sum = 1;
        return ;
    }
    nod[ind].mid = (ll + rr) >> 1;
    build(ll, nod[ind].mid, ind * 2);
    build(nod[ind].mid + 1, rr, ind * 2 + 1);
    nod[ind].sum = nod[ind * 2].sum + nod[ind * 2 + 1 ].sum;
}

void update(int ll, int rr, int k, int ind)
{
    if(ll == nod[ind].l && rr == nod[ind].r)
    {
        nod[ind].kind = k;
        nod[ind].sum = k * (rr - ll + 1);
        return ;
    }
    
    //if((nod[ind].sum != nod[ind * 2].sum + nod[ind * 2 + 1].sum)|| (nod[ind].kind != nod[ind * 2].kind) || (nod[ind].kind != nod[ind * 2 + 1].kind))
    if(nod[ind].kind != -1)//如果没有被分裂，要分裂 ，或者说两边的都已经更新完了 
    {
        nod[ind * 2].kind = nod[ind].kind;
        nod[ind * 2 + 1].kind = nod[ind].kind;

        nod[ind * 2].sum = nod[ind].kind * (nod[ind * 2].r - nod[ind * 2].l + 1);
        nod[ind * 2 + 1].sum = nod[ind].kind * (nod[ind * 2 + 1].r - nod[ind * 2 + 1].l + 1);
        nod[ind].kind = -1;//标记已被分裂 
    }

    if(rr <= nod[ind].mid)
    {
        update(ll, rr, k, ind * 2);
    }
    else if(ll > nod[ind].mid)
        update(ll, rr, k, ind * 2 + 1);
    else
    {
        update(ll, nod[ind].mid, k, ind * 2);
        update(nod[ind].mid + 1, rr, k, ind * 2 + 1);
    }
    nod[ind].sum = nod[ind * 2].sum + nod[ind * 2 + 1].sum;
}
int main()
{
    int tc;
    int n;
    int i, j;
    int x, y, k, q;

    while(scanf("%d", &tc) == 1)
    {
        for(j = 1; j <= tc; j++)
        {
            scanf("%d", &n);
            build(1, n, 1);
            scanf("%d", &q);
            for(i = 0; i < q; i++)
            {
                scanf("%d%d%d", &x, &y, &k);
                if(x > y)
                {
                    int t = x;
                    x = y;
                    y = t;
                }
                update(x, y, k, 1);
            }
            printf("Case %d: The total value of the hook is %d.\n", j, nod[1].sum);
        }
    }
    return 0;
}