bzoj 2424

裸费用流，要注意的是当天供应的东西不一定要从仓库里拿，所以S限制的容量应该是i'-(i+1)的

数据那么弱，暴力或许过得去？

#include<bits/stdc++.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define NM 150
#define nm 10000
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct edge{
    int t,v,w;
    edge *next,*rev;
}e[nm],*h[NM],*o=e,*p[NM];
void _add(int x,int y,int w,int v){
    o++;o->t=y;o->v=v;o->w=w;o->next=h[x];h[x]=o;
}
void add(int x,int y,int w,int v){
    _add(x,y,w,v);_add(y,x,0,-v);
    h[x]->rev=h[y];h[y]->rev=h[x];
}
int n,m,V,tot,d[NM],b[NM],ans;
bool v[NM];
queue<int >q;
int spfa(){
    mem(v);mem(b);
    inc(i,0,n)d[i]=inf;
    v[0]++;q.push(0);d[0]=0;b[0]=inf;
    while(!q.empty()){
        int t=q.front();q.pop();v[t]=false;
        link(t)
        if(j->w&&d[j->t]>d[t]+j->v){
            d[j->t]=d[t]+j->v;
            p[j->t]=j;b[j->t]=min(b[t],j->w);
            if(!v[j->t])v[j->t]++,q.push(j->t);
        }
    }
    return d[n]<inf;
}
int main(){
    freopen("data.in","r",stdin);
    n=read();m=read();V=read();tot=2*n+1;
    inc(i,1,n)add(i+n,tot,read(),0);
    inc(i,1,n)add(0,i,inf,read());
    inc(i,1,n)add(i,i+n,inf,0);
    inc(i,1,n-1)add(i+n,i+1,V,m);
    n=tot;
    while(spfa()){
        ans+=d[n]*b[n];
        for(int x=n;x;x=p[x]->rev->t)
        p[x]->w-=b[n],p[x]->rev->w+=b[n];
    }
    printf("%d
",ans);
    return 0;
}