codeforces 862E (二分)

原题题面

Dr. Evil is interested in math and functions, so he gave Mahmoud and Ehab array $a$ of length $n$ and array $b$ of length $m$. He introduced a function $f(j)$ which is defined for integers $j$, which satisfy $0\le j\le m-n$. Suppose, $c_i=a_i-b_{i+j}$. Then $f(j)=|c_1-c_2+c_3-c_4...c_n|$. More formally,$f(j)=|{\sum }_{i=1}^n(-1{)}^{i-1}\ast (a_i-b_{i+j})|$.

Dr. Evil wants Mahmoud and Ehab to calculate the minimum value of this function over all valid $j$. They found it a bit easy, so Dr. Evil made their task harder. He will give them $q$ update queries. During each update they should add an integer $x_i$ to all elements in a in range $[l_i;r_i]$ i.e. they should add $x_i$ to $a_{l_i},a_{l_{i+1}},...,a_{r_i}$ and then they should calculate the minimum value of $f(j)$ for all valid $j$.

Please help Mahmoud and Ehab.

输入格式

The first line contains three integers $n$, $m$ and $q$ $(1\le n\le m\le 10^5,1\le q\le 10^5)$ — number of elements in $a$, number of elements in $b$ and number of queries, respectively.
The second line contains $n$ integers $a_1,a_2,...,a_n.(-10^9\le a_i\le 10^9)$ — elements of $a$.
The third line contains $m$ integers $b_1,b_2,...,b_m.(-10^9\le b_i\le 10^9)$ — elements of $b$.
Then $q$ lines follow describing the queries. Each of them contains three integers $l_i,r_i,x_i(1\le l_i\le r_i\le n,-10^9\le x\le 10^9)$ — range to be updated and added value.

输出格式

The first line should contain the minimum value of the function $f$ before any update.
Then output $q$ lines, the $i-th$ of them should contain the minimum value of the function $f$ after performing the $i-th$ update .

输入样例

5 6 3
1 2 3 4 5
1 2 3 4 5 6
1 1 10
1 1 -9
1 5 -1

输出样例

0
9
0
0

题面分析

$|{\sum }_{i=1}^n(-1{)}^{i-1}\ast (a_i-b_{i+j})|$
=$|{\sum }_{i=1}^n(-1{)}^{i-1}\ast a_i-(-1{)}^{i-1}\ast b_{i+j}|$
=$|{\sum }_{i=1}^n(-1{)}^{i-1}\ast a_i-{\sum }_{i=1}^n(-1{)}^{i-1}\ast b_{i+j}|$
我们记$prefixA={\sum }_{i=1}^n(-1{)}^{i-1}\ast a_i$,
$sumB={\sum }_{i=1}^n(-1{)}^{i-1}\ast b_i$,
考虑到${\sum }_{i=1}^n(-1{)}^{i-1}\ast b_{i+j}$的首项符号会有正负，因此我们再定义
$prefixB[i]=(-1{)}^{i-1}sum[i+n-1]-sum[i-1]$
那问题就转化为：
求$|prefixA-prefixB|$的最小值。
我们算出所有的$prefixB$进行排序，二分查找$-prefixA$即可。
最后计算时要考虑相邻两个数字的值,即$prefixA-prefix[pos-1/pos/pos+1]$三者的最小值。

AC代码（171ms）

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=5e5;
ll prefixA=0;
ll prefixB[maxn+10];
ll sumB[maxn+10];
ll b[maxn+10];
int main() {
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    for(int i=1; i<=n; i++) {
        ll x;
        scanf("%lld", &x);
        if (i&1) {
            prefixA+=x;
        }
        else
            prefixA-=x;
    }
    sumB[0]=0;
    for(int i=1; i<=m; i++) {
        scanf("%lld", &b[i]);
        if (i&1) {
            sumB[i]=sumB[i-1]+b[i];
        }
        else {
            sumB[i]=sumB[i-1]-b[i];
        }
    }
    for(int i=1; i<=m-n+1; i++) {
        if (!(i&1)) {
            prefixB[i-1]=sumB[i-1+n]-sumB[i-1];//[i,i+n-1]
        }
        else {
            prefixB[i-1]=sumB[i-1]-sumB[i-1+n];//-[i,i+n-1]
        }
    }
    sort(prefixB, prefixB+m-n+1);
    int pos=lower_bound(prefixB, prefixB+m-n+1, -prefixA)-prefixB;
    pos=min(pos, m-n);
    printf("%lld\n", min(
            min(abs(prefixA+prefixB[max(pos-1, 0)]),
                abs(prefixA+prefixB[pos])),
            abs(prefixA+prefixB[min(pos+1, m-n)])));
    while(q--) {
        ll l, r, x;
        scanf("%lld%lld%lld", &l, &r, &x);
        if ((r-l+1)&1) {
            if (l&1) {
                prefixA+=x;
            }
            else {
                prefixA-=x;
            }
        }
        pos=lower_bound(prefixB, prefixB+m-n+1, -prefixA)-prefixB;
        pos=min(pos, m-n);
        printf("%lld\n", min(
                min(abs(prefixA+prefixB[max(pos-1, 0)]),
                    abs(prefixA+prefixB[pos])),
                abs(prefixA+prefixB[min(pos+1, m-n)])));
    }
}

后记

思路五分钟，调参两小时，好耶。
DrGilbert 2020.12.10