【HDU - 6315】 Naive Operations 【线段树 + 思维】

Naive Operations
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others)
Total Submission(s): 1247 Accepted Submission(s): 521

Problem Description
In a galaxy far, far away, there are two integer sequence a and b of length n.
b is a static permutation of 1 to n. Initially a is filled with zeroes.
There are two kind of operations:
1. add l r: add one for $a_l,a_{l+1}...a_r$
2. query l r: query$\sum_{i=l}^r \lfloor a_i / b_i \rfloor$

Input
There are multiple test cases, please read till the end of input file.
For each test case, in the first line, two integers n,q, representing the length of a,b and the number of queries.
In the second line, n integers separated by spaces, representing permutation b.
In the following q lines, each line is either in the form ‘add l r’ or ‘query l r’, representing an operation.
$1 \leq n,q \leq 100000$ , $1 \leq l \leq r \leq n$ there’re no more than 5 test cases.

Output
Output the answer for each ‘query’, each one line.

Sample Input

5 12
1 5 2 4 3
add 1 4
query 1 4
add 2 5
query 2 5
add 3 5
query 1 5
add 2 4
query 1 4
add 2 5
query 2 5
add 2 2
query 1 5

Sample Output

1
1
2
4
4
6

Source
2018 Multi-University Training Contest 2

分析 : 线段树区间加减和查询的基础上，又维护了一个 $min(b_i-a_i \%b_i)$ . 然后每次更新的时候只把可以造成贡献+1的位置更新一下。
代码

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define bug(x)  cout<<"@@  "<<x<<"\n"

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int N = (int) 1e5 + 11;
const int M = (int) 1e6 + 11;
const int INF = (int)0x3f3f3f3f;
const int MOD = (int)1e9 + 7;

int sum[N << 2], mnb[N << 2], b[N], lazy[N << 2];
void Up(int rt){
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
    mnb[rt] = min(mnb[rt << 1], mnb[rt << 1 | 1]); 
}
void Down(int rt){
    if(lazy[rt]){
        lazy[rt << 1] += lazy[rt]; mnb[rt << 1] -= lazy[rt];
        lazy[rt << 1 | 1] += lazy[rt]; mnb[rt << 1 | 1] -=lazy[rt];
        lazy[rt] = 0; 
    }
}
void Build(int rt, int L, int R){
    lazy[rt] = 0;
    if(L == R){
        scanf("%d", &b[L]);
        mnb[rt] = b[L]; sum[rt] = 0;
        return ;
    }
    int mid = (L + R) >> 1;
    Build(rt << 1, L, mid);
    Build(rt << 1 | 1, mid + 1, R);
    Up(rt);
}
void Change(int rt, int L, int R){
    if(L == R){
        if(!mnb[rt]) {
            mnb[rt] = b[L]; sum[rt]++;
        }
        lazy[rt]  = 0;
        return;
    }
    Down(rt);
    int mid = (L + R) >> 1;
    if(!mnb[rt << 1]) Change(rt << 1, L, mid);   //  *  这里保证了 只更新 可以造成贡献增加的位置
    if(!mnb[rt << 1 | 1]) Change(rt << 1 | 1, mid + 1, R); // *
    Up(rt);
}
void Update(int rt, int L, int R, int le, int ri){
    if(L == le && ri == R){
        lazy[rt]++; mnb[rt]--;
        if(!mnb[rt]) {
            Change(rt, L, R);
        }
        return;
    }
    Down(rt);
    int mid = (L + R) >> 1;
    if(ri <= mid) Update(rt << 1, L, mid, le, ri);
    else if(le > mid) Update(rt << 1 | 1, mid + 1, R, le, ri);
    else Update(rt << 1, L, mid, le, mid), Update(rt << 1 | 1, mid + 1, R, mid + 1, ri);
    Up(rt);
}
int Query(int rt, int L, int R, int le, int ri){
    if(L == le && R == ri) return sum[rt];
    Down(rt);
    int mid = (L + R) >> 1;
    if(ri <= mid) return Query(rt << 1, L, mid, le, ri);
    else if(le > mid) return Query(rt << 1 | 1, mid + 1, R, le, ri);
    else return Query(rt << 1, L, mid, le, mid) + Query(rt << 1 | 1, mid + 1, R, mid + 1, ri);
}
int n, q;   
void solve(){
    Build(1, 1, n);
    char s[10];
    while(q--){
        int a, b;
        scanf("%s%d%d", s, &a, &b);
        if(s[0] == 'a') Update(1, 1, n, a, b);
        else printf("%d\n", Query(1, 1, n, a, b));
    }
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    while(scanf("%d%d", &n, &q) !=  EOF) solve();
    return 0;
}