Black or White Gym - 101986E

https://cn.vjudge.net/problem/Gym-101986E 

还没搞懂为什么是sum[i]-sum[j+1]+1

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;

ll dp[maxn];
ll sum[maxn];
char s[maxn],t[maxn];
deque<int>q;
int main()
{
    //freopen("input.txt","r",stdin);

    int n,k;
    cin>>n>>k;

    scanf("%s%s",s+1,t+1);

    for(int i=1;i<=n;i++)
    {
        sum[i]=sum[i-1]+(t[i]!=t[i-1]);
        //cout<<sum[i]<<" ";
    }

    q.push_front(0);
    for(int i=1;i<=n;i++)
    {
        while(!q.empty()&&q.back()+k<i) q.pop_back();
        if(s[i]==t[i]) dp[i]=dp[i-1];
        else
            dp[i]=dp[q.back()]+(sum[i]-sum[q.back()+1]+1)/2+1;
        //cout<<i<<" "<<q.back()<<" "<<dp[i]<<endl;;
        //if(sum[i+1]==sum[i]) sum[i]--;
        //if(t[i]==t[i+1]) sum[i]--;
        while(!q.empty()&&((2*dp[q.front()]-sum[q.front()+1])>=2*dp[i]-sum[i+1])) q.pop_front();
        q.push_front(i);
    }

    //cout<<endl;
    //for(int i=1;i<=n;i++) cout<<sum[i]<<" ";

    cout<<dp[n]<<endl;

    return 0;
}