BZOJ2424: [HAOI2010]订货

从0到i建容量为U[i]，费用为零的边。(订货)
从i到n+1容量无限，费用为的的d[i]边。(售出)
从i到i+1容量为S，费用为m的边。(存贮)
然后跑费用流就好了。

#include<cstdio
#include<cctype>
#include<cstring>
#include<algorithm>
#define maxn 55
#define maxe 1005
using namespace std;
struct edge{int u,v,cap,flow,c,nt;}e[maxe];
int n,m,S,INF=2e9,hd,tl,tot,ans,pre[maxn],dt[maxn],que[maxe],lk[maxn];
bool vis[maxn];
inline int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=(x<<3)+(x<<1)+ch-48,ch=getchar();
    return x;
}
void add(int u,int v,int x,int y){
    e[tot]=(edge){u,v,x,0,y,lk[u]};lk[u]=tot++;
    e[tot]=(edge){v,u,0,0,-y,lk[v]};lk[v]=tot++;
}
bool spfa(){
    memset(dt,63,sizeof dt);
    memset(pre,-1,sizeof pre);
    memset(vis,0,sizeof vis);
    que[tl=1]=hd=dt[0]=0;
    while (hd!=tl){
        vis[que[++hd]]=0;
        for (int j=lk[que[hd]];j>-1;j=e[j].nt)
        if (e[j].cap>e[j].flow&&dt[que[hd]]+e[j].c<dt[e[j].v]){
            dt[e[j].v]=dt[que[hd]]+e[j].c;pre[e[j].v]=j;
            if (!vis[e[j].v]){
                vis[que[++tl]=e[j].v]=1;
                if (dt[que[hd+1]]>dt[que[tl]]) swap(que[hd+1],que[tl]);
            }
        }
    }
    return pre[n+1]>-1;
}
void work(){
    int mi=2e9;
    for (int j=pre[n+1];j>-1;j=pre[e[j].u]) mi=min(mi,e[j].cap-e[j].flow);
    for (int j=pre[n+1];j>-1;j=pre[e[j].u]) e[j].flow+=mi,e[j^1].flow-=mi,ans+=e[j].c*mi;
}
int main()
{
    n=read(),m=read(),S=read();
    memset(lk,-1,sizeof lk);
    for (int i=1,x;i<=n;++i) x=read(),add(i,n+1,x,0);
    for (int i=1,x;i<=n;++i) x=read(),add(0,i,INF,x);
    for (int i=1;i<n;++i) add(i,i+1,S,m);
    while (spfa()) work();
    printf("%d\n",ans);
    return 0;
}