ZJOI2010 基站选址

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 20050
#define K 105
#define ll long long
const int inf = 0x3f3f3f3f;
const ll Inf  = 0x3f3f3f3f3f3f3f3fll;
inline int rd()
{
    int f=1,c=0;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){c=10*c+ch-‘0‘;ch=getchar();}
    return f*c;
}
int n,k;
ll d[N],c[N],s[N],w[N],f[N][K];
struct segtree
{
    ll vl[N<<2],tag[N<<2];
    void add(int u,ll d)
    {
        vl[u]+=d;
        tag[u]+=d;
    }
    void pushdown(int u)
    {
        if(tag[u])
        {
            add(u<<1,tag[u]);
            add(u<<1|1,tag[u]);
            tag[u] = 0;
        }
    }
    void update(int u)
    {
        vl[u] = min(vl[u<<1],vl[u<<1|1]);
    }
    void build(int l,int r,int u,int k)
    {
        tag[u]=0;
        if(l==r)
        {
            vl[u]=f[l][k];
            return ;
        }
        int mid = (l+r)>>1;
        build(l,mid,u<<1,k);
        build(mid+1,r,u<<1|1,k);
        update(u);
    }
    void insert(int l,int r,int u,int ql,int qr,ll d)
    {
        if(l==ql&&r==qr)
        {
            add(u,d);
            return ;
        }
        pushdown(u);
        int mid = (l+r)>>1;
        if(qr<=mid)insert(l,mid,u<<1,ql,qr,d);
        else if(ql>mid)insert(mid+1,r,u<<1|1,ql,qr,d);
        else insert(l,mid,u<<1,ql,mid,d),insert(mid+1,r,u<<1|1,mid+1,qr,d);
        update(u);
    }
    ll query(int l,int r,int u,int ql,int qr)
    {
        if(l==ql&&r==qr)return vl[u];
        pushdown(u);
        int mid = (l+r)>>1;
        if(qr<=mid)return query(l,mid,u<<1,ql,qr);
        else if(ql>mid)return query(mid+1,r,u<<1|1,ql,qr);
        else return min(query(l,mid,u<<1,ql,mid),query(mid+1,r,u<<1|1,mid+1,qr));
    }
}tr;
int fdl(ll k)
{
    int l=0,r=n,ans=0;
    while(l<=r)
    {
        int mid = (l+r)>>1;
        if(d[mid]<k)ans=mid,l=mid+1;
        else r=mid-1;
    }
    return ans;
}
int fdr(ll k)
{
    int l=0,r=n,ans=0;
    while(l<=r)
    {
        int mid = (l+r)>>1;
        if(d[mid]>k)ans=mid,r=mid-1;
        else l=mid+1;
    }
    return ans;
}
int l[N],r[N],hed[N],cnt;
struct EG
{
    int to,nxt;
}e[N];
void ae(int f,int t)
{
    e[++cnt].to = t;
    e[cnt].nxt = hed[f];
    hed[f] = cnt;
}
int main()
{
//    freopen("3.in","r",stdin);
    n = rd(),k = rd();d[0] = -Inf;
    for(int i=2;i<=n;i++)d[i]=rd();
    for(int i=1;i<=n;i++)c[i]=rd();
    for(int i=1;i<=n;i++)s[i]=rd();
    for(int i=1;i<=n;i++)w[i]=rd();
    n++,k++;
    d[n]=Inf,c[n]=0,s[n]=0,w[n]=0;
    memset(f,0x3f,sizeof(f));
    f[0][0]=0;
    for(int i=1;i<=n;i++)
    {
        l[i] = fdl(d[i]-s[i]);
        r[i] = fdr(d[i]+s[i]);
        ae(r[i],i);
    }
    ll ans = Inf;
    for(int g=1;g<=k;g++)
    {
        tr.build(0,n,1,g-1);
        for(int i=1;i<=n;i++)
        {
            /*while(d[b]+s[b]<d[i])
            {
                tr.insert(0,n,1,0,sit[b],w[b]);
                b++;
            }*/
            for(int j=hed[i];j;j=e[j].nxt)
            {
                int to = e[j].to;
                tr.insert(0,n,1,0,l[to],w[to]);
            }
            f[i][g] = tr.query(0,n,1,0,i-1)+c[i];
        }
        ans = min(ans,f[n][g]);
    }
    printf("%lld\n",ans);
    return 0;
}