一开始想了一个错误的建图,后来看了题解才发现建图这么巧妙,用流量为k,费用为0的边将序列穿起来,然后每个点i向点i+m连一条流量为1,费用为a[i]的边,结果费用流写呲了,调了一会。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 10010
#define maxm 10001
#define inf 1000000000
using namespace std;
int n,m,num,ans,s,t,k;
int f[2*maxm],to[2*maxm],c[2*maxm],next[2*maxm],head[maxn];
int dis[maxn],p[2*maxm],fr[maxn],q[maxn];
bool vis[maxn];
void addedge(int x,int y,int z,int w)
{
num++;p[num]=x;to[num]=y;c[num]=z;f[num]=w;next[num]=head[x];head[x]=num;
num++;p[num]=y;to[num]=x;c[num]=0;f[num]=-w;next[num]=head[y];head[y]=num;
}
bool spfa()
{
memset(vis,0,sizeof(vis));
for (int i=s;i<=t;i++) dis[i]=-1;
int l=0,r=1;
q[1]=s;vis[s]=1;dis[s]=0;
while (l!=r)
{
l++;if (l==maxn) l=0;
int x=q[l];
for (int p=head[x];p;p=next[p])
if (c[p] && dis[to[p]]<dis[x]+f[p])
{
dis[to[p]]=dis[x]+f[p];
fr[to[p]]=p;
if (!vis[to[p]])
{
r++;if (r==maxn) r=0;
q[r]=to[p];vis[to[p]]=1;
}
}
vis[x]=0;
}
if (dis[t]==-1) return 0; else return 1;
}
void mcf()
{
int x=inf;
for (int i=fr[t];i;i=fr[p[i]]) x=min(x,c[i]);
for (int i=fr[t];i;i=fr[p[i]]) c[i]-=x,c[i^1]+=x,ans+=x*f[i];
}
int main()
{
scanf("%d%d%d",&n,&m,&k);num=1;s=0;t=n+1;
for (int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
addedge(i-1,i,k,0);
if (i+m<=n) addedge(i,i+m,1,x);
else addedge(i,t,1,x);
}
addedge(n,t,k,0);
while (spfa()) mcf();
printf("%d\n",ans);
return 0;
}