2015 ACM Amman Collegiate Programming Contest L. Alternating Strings II(dp+线段树)

#include<bits/stdc++.h>
using namespace std;
char t[100003];
int dp[100003];
struct node
{
    int left,right,mid;
    int x;
}tree[400004];
void build(int l,int r,int rt)
{
    tree[rt].left=l;
    tree[rt].right=r;
    tree[rt].mid=(l+r)/2;
    if(l==r)
    {
        tree[rt].x=dp[l];
        return;
    }
    build(l,tree[rt].mid,rt<<1);
    build(tree[rt].mid+1,r,rt<<1|1);
    tree[rt].x=min(tree[rt<<1].x,tree[rt<<1|1].x);
}
void update(int L,int C,int rt)
{
    if(tree[rt].left==tree[rt].right)
    {
        tree[rt].x=C;
        return;
    }
    if(L<=tree[rt].mid)
        update(L,C,rt<<1);
    else
        update(L,C,rt<<1|1);
    tree[rt].x=min(tree[rt<<1].x,tree[rt<<1|1].x);
}
int query(int l,int r,int rt)
{
    if(tree[rt].left>=l&&tree[rt].right<=r)
        return tree[rt].x;
    int mi=1e9;
    if(tree[rt].mid>=l)
        mi=min(mi,query(l,r,rt<<1));
    if(tree[rt].mid<r)
        mi=min(mi,query(l,r,rt<<1|1));
    return mi;
}
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        int n,m;scanf("%d%d",&n,&m);
        scanf("%s",t+1);
        dp[1]=0;dp[0]=-1;int id=-1e9;
        for(int i=2;i<=n;i++)
            dp[i]=1e9;
        build(1,n,1);
        for(int i=2;i<=n;i++)
        {
            if(t[i]==t[i-1])
                id=i-1;
            if(i-id+1>m)dp[i]=dp[i-1]+1;
            else
            {
                if(i-m<1)dp[i]=0;
                else dp[i]=query(i-m,id-1,1)+1;
            }
            update(i,dp[i],1);
            //printf("%d\n",dp[i]);
        }
        printf("%d\n",dp[n]);
    }
    return 0;
}