CodeForces 862E Mahmoud and Ehab and the function 暴力，二分

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 200005;

int n, m, q, cnt;
ll a[N], b[N], s1, c[N], sum[N];
ll  getMin(ll s)
{
    int pos = lower_bound(c, c+1+cnt, -s)-c;
    return min(abs(s+c[pos]), abs(s+c[pos-1]));
}
int main()
{
    scanf("%d%d%d", &n, &m, &q);
    rep(i,1,n)
    {
        scanf("%lld", &a[i]);
        if(i&1) s1+=a[i];  else s1-=a[i];
    }
    rep(i,1,m)
    {
        scanf("%lld", &b[i]);
        if(i>1) sum[i]=sum[i-2];
        sum[i]+=b[i];
    }
    c[cnt]=-1e18;
    rep(i,n,m)
    {
        ll  s2=sum[i],  s3=sum[i-1];
        int pos = i-n+1;
        if(n&1)
        {
            s2 -= sum[max(pos-2,0)];
            s3 -= sum[max(pos-1,0)];
            c[++cnt] = -s2+s3;
        }
        else
        {
            s2 -= sum[max(pos-1,0)];
            s3 -= sum[max(pos-2,0)];
            c[++cnt] = s2-s3;
        }
    }
    c[++cnt]=1e18;
    sort(c, c+1+cnt);
    printf("%lld\n", getMin(s1) );
    ll  l, r, x;
    rep(i,1,q)
    {
        scanf("%lld%lld%lld", &l, &r, &x);
        if((r-l+1)&1)
        {
            if(l&1) s1+=x;  else s1-=x;
        }
        printf("%lld\n", getMin(s1) );
    }

    return 0;
}