Day 2 G - Naive Operation HDU 6315 | 线段树 | 思维

RMQ离线算法（也就是Tarjan）不适合于区间值频繁修改的情况

• 对区间查询问题，使用数组暴力相加的方法，求和复杂，但修改容易；通过前缀和预处理，则求和容易，修改困难；线段树是求和、修改均较高效的方法
• 线段树在建树的时候是自上向下分割的，递归时注意mid+1的情况
• 如果目标数组长度为n，那么tree数组简记需要4* n，具体计算是要取离n最近并且比n大的一个2^n的数，并将之*2（如n=5，那么最近的就是8，*2应该开16）
• 可以通过这种方式简化代码，但是要注意如果这么写那所有的函数表示树上节点编号时都要用i

#define lson (i << 1)//i*2
#define rson (i << 1 | 1)//i*2+1

• Query递归的过程（所以不应该是==而应该是>= <= 使当前管辖区间被ql,qr覆盖）
  
• 建树时对值的更新出错，最初写的不是left而是i
  
• 通过lazy_tag进行优化（a[] / b[]，如果a[] < b[]，向下取整，对求和结果是不会有影响的。所以只有当a[]++至a[]>=b[]时才会+1 。lazy做的就是检测当前节点管辖区间内最小的b[]（a[]++次数最少就能+1），如果连最小的b[]都不满足，那么就不必下放，整个区间都不会有变化。（因为本题是连续区间，而且+相同数，所以可以积累每次操作，在满足时一起下放，这样就省去了每次都从根走到底的开销）
• 最开始补充了线段树的知识之后，也还是没想出这道题该怎么做。看了题解才明白了思路。不是对a[], b[]进行维护，而是选择对a[] / b[]进行维护！

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define lson (i << 1)//i*2
#define rson (i << 1 | 1)//i*2+1

const ll MAX_N = 100010;
//1≤n,q≤100000, 1≤l≤r≤n
int n, q, l, r;
int b[MAX_N];
//int tempb[MAX_N];
char que[20];

struct treeNode
{
    int l, r; // 左右区间
    int sum;  //当前c[i]和

    int a;    //c[i]的分母
    int lazy; //该节点对应区间内应该add的分母值（但是尚未下放
    int minn; //最少还需向下传递多少累加值才能导致某点a/b增加1
    int val;
}tree[MAX_N*4];

/****lazy*/
void pushup(int i)
{
    //cout << "pushup" << endl;

    tree[i].sum = tree[lson].sum + tree[rson].sum;
    tree[i].minn = min(tree[lson].minn - tree[lson].lazy, tree[rson].minn - tree[rson].lazy);
}

void pushdown(int l, int r, int i)
{
    //cout << "pushdown" << " " << l << " " << r << endl;
    //cout << l <<"    "<<r <<"    "<<tree[i].lazy <<"   "<<tree[i].minn <<"    "<<tree[i].sum <<endl;
    if(l == r)//到达叶子
    {
        //cout << "l==r" << endl;
        tree[i].a += tree[i].lazy;
        tree[i].lazy = 0;

        //cout << "tree[i].val = " << tree[i]. val << endl;

        tree[i].sum = tree[i].a / tree[i].val;
        tree[i].minn = tree[i].val - (tree[i].a % tree[i].val);
        return;
    }

    if(tree[i].lazy < tree[i].minn)//即使下放也没法+1
    {
        //cout << "zhijieriturn" << endl;
        return;
    }

    tree[lson].lazy += tree[i].lazy;
    tree[rson].lazy += tree[i].lazy;
    tree[i].lazy = 0;

    //cout << "xiangxiadigui" <<endl;
    int mid = (l + r)/2;
    pushdown(l, mid, lson);
    pushdown(mid + 1, r, rson);

    pushup(i);
}

/****建树*/
void buildSegTree(int i, int left, int right)
{
    //cout << "buildSegTree i = " << i << " left = " << left << " right = " << right << endl;
    tree[i].lazy = 0;
    tree[i].sum = 0;

    tree[i].l = left;
    tree[i].r = right;
    if(left == right)//已缩到叶子节点
    {
        tree[i].minn = b[left];
        tree[i].val = b[left];

        //cout << "build-  b[" << i << "] = " << b[i] << " tree[i].val = " << tree[i].val << endl;
        tree[i].a = 0;
        return;
    }

    int mid = (right + left)/2;

    buildSegTree(lson, left, mid);
    buildSegTree(rson, mid+1, right);

    //tree[i].sum = tree[lson].sum + tree[rson].sum;没啥必要
    tree[i].minn = min(tree[lson].minn, tree[rson].minn);
}

/****查询*/
//自根节点开始查询，查询[a,b]时若根节点表示[l, r]，要判断[a,b]落在[l,r]的哪个区间当中
//mid = l + (l-r)/2 ?
/*int Query(int ql, int qr, int l, int r, int i)
{
    cout << "Query" << " ql = " << ql << " qr = " << qr << " l = " << l << " r = " << r << endl;

    if(l >= ql && r <= qr)
        return tree[i].sum;
    int mid = (l+r)/2;

    int ans = 0;

    if(ql <= mid)
        ans += Query(ql, qr, l, mid, lson);
    if(qr > mid)
        ans += Query(ql, qr, mid+1, r, rson);

    return ans;
}*/
int Query(int ql, int qr, int i)
{
    //cout << "Query" << " ql = " << ql << " qr = " << qr << " l = " << l << " r = " << r << endl;

    if(tree[i].l >= ql && tree[i].r <= qr)
        return tree[i].sum;
    int mid = (tree[i].l+tree[i].r)/2;

    int ans = 0;

    if(ql <= mid)
        ans += Query(ql, qr, lson);
    if(qr > mid)
        ans += Query(ql, qr, rson);

    return ans;
}
/****更新*/

void modify(int ql, int qr, int i)
{
    if(ql <= tree[i].l && qr >= tree[i].r)
    {
          tree[i].lazy += 1;
          pushdown(tree[i].l, tree[i].r, i);
          return;
     }

     if(tree[i].lazy != 0)
     {
         tree[lson].lazy += tree[i].lazy;
         tree[rson].lazy += tree[i].lazy;
         tree[i].lazy = 0;
     }

     int mid = tree[i].l +(tree[i].r-tree[i].l)/2;
     if(ql <= mid)
        modify(ql, qr, lson);
     if(qr > mid)
        modify(ql, qr, rson);
     pushup(i);
}

int main()
{
    while(~scanf("%d%d", &n, &q))
    {
        //cout << "n = " << n << endl;

        for(int i = 1;i <= n;i++)
        {
            scanf("%d", &b[i]);
        }

        buildSegTree(1, 1, n);
        for(int i = 1;i <= q;i++)
        {
            //cout << "i - " << i << endl;
            l = 0, r = 0;
            scanf("%s", que);
            scanf("%d%d", &l, &r);

            if(que[0] == 'a')//add
            {
                modify(l, r, 1);
            }
            else
            {
                printf("%d\n", Query(l, r, 1));
                //printf("%d\n", Query(l, r, 1, n, 1));
            }
        }
    }
    return 0;
}



/******/