[BZOJ1283]序列（费用流）

题目描述

传送门

题解

问题可以转化为选k次，每次选一个子序列，每一次选连续m个里面只能选一个
对序列中每一个元素建立一个点$p_i$
s->$p_1$,k,0，$p_n$->t,k,0
$p_i$->$p_{i+1}$,k,0
对于1<=i<=n-m，$p_i$->$p_{i+m}$,1,$a_i$
对于n-m+1<=i<=n，$p_i$->t,1,$a_i$
最大费用最大流

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 10005
#define inf 1000000000

int n,m,k,s,t,maxflow,maxcost;
int a[N];
int tot,point[N],nxt[N],v[N],remain[N],c[N];
int dis[N],last[N];
bool vis[N];
queue <int> q;

void addedge(int x,int y,int cap,int z)
{
    ++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remain[tot]=cap; c[tot]=z;
    ++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remain[tot]=0; c[tot]=-z;
}
int addflow(int s,int t)
{
    int now=t,ans=inf;
    while (now!=s)
    {
        ans=min(ans,remain[last[now]]);
        now=v[last[now]^1];
    }
    now=t;
    while (now!=s)
    {
        remain[last[now]]-=ans;
        remain[last[now]^1]+=ans;
        now=v[last[now]^1];
    }
    return ans;
}
bool spfa(int s,int t)
{
    memset(dis,128,sizeof(dis));dis[s]=0;
    memset(vis,0,sizeof(vis));vis[s]=1;
    while (!q.empty()) q.pop();q.push(s);

    while (!q.empty())
    {
        int now=q.front();q.pop();
        vis[now]=0;
        for (int i=point[now];i!=-1;i=nxt[i])
            if (dis[v[i]]<dis[now]+c[i]&&remain[i])
            {
                dis[v[i]]=dis[now]+c[i];
                last[v[i]]=i;
                if (!vis[v[i]]) q.push(v[i]);
            }
    }
    if (dis[t]<-inf) return false;
    int flow=addflow(s,t);
    maxflow+=flow;
    maxcost+=flow*dis[t];
    return true;
}
int main()
{
    tot=-1;memset(point,-1,sizeof(point));
    scanf("%d%d%d",&n,&m,&k);
    for (int i=1;i<=n;++i) scanf("%d",&a[i]);
    s=1,t=n+2;
    addedge(s,2,k,0),addedge(1+n,t,k,0);
    for (int i=1;i<n;++i) addedge(1+i,1+i+1,k,0);
    for (int i=1;i<=n-m;++i) addedge(1+i,1+i+m,1,a[i]);
    for (int i=n-m+1;i<=n;++i) addedge(1+i,t,1,a[i]);
    while (spfa(s,t));
    printf("%d\n",maxcost);
}