好像有个叫单纯形法的东西?我不会qwq。。
Byvoid神犇的题解
好神啊。。
要注意善于添加辅助变量将不等关系转化为等量关系,
由正负的平衡转化为网络流图中的流量平衡,实现模型的转化。
#include<iostream>
#include<cstdio>
#include<cstring>
#define inf 1000000007
#define M 1005
using namespace std;
int n,m,cnt=1,ans,T=1001;
int head[1005],q[1005],dis[1005],path[1005];
bool vis[1005];
int next[50005],list[50005],from[50005],flow[50005],cost[50005];
inline int read()
{
int a=0,f=1; char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
return a*f;
}
inline void insert(int x,int y,int z,int w)
{
next[++cnt]=head[x];
head[x]=cnt;
from[cnt]=x;
list[cnt]=y;
flow[cnt]=z;
cost[cnt]=w;
}
inline bool spfa()
{
for (int i=0;i<=T;i++) dis[i]=inf;
dis[0]=0; vis[0]=1; q[1]=0;
int t=0,w=1,x;
while (t!=w)
{
t=(t+1)%M;
x=q[t];
for (int i=head[x];i;i=next[i])
if (flow[i]&&dis[list[i]]>dis[x]+cost[i])
{
dis[list[i]]=dis[x]+cost[i];
path[list[i]]=i;
if (!vis[list[i]])
{
vis[list[i]]=1;
w=(w+1)%M;
q[w]=list[i];
}
}
vis[x]=0;
}
return dis[T]!=inf;
}
inline void mcf()
{
int x=inf;
for (int i=path[T];i;i=path[from[i]]) x=min(x,flow[i]);
for (int i=path[T];i;i=path[from[i]])
ans+=x*cost[i],flow[i]-=x,flow[i^1]+=x;
}
int main()
{
n=read(); m=read();
int last=0,now;
for (int i=1;i<=n;i++)
{
now=read();
int x=now-last;
if (x>0) insert(0,i,x,0),insert(i,0,0,0);
else insert(i,T,-x,0),insert(T,i,0,0);
insert(i+1,i,inf,0); insert(i,i+1,0,0);
last=now;
}
insert(n+1,T,last,0);
insert(T,n+1,0,0);
for (int i=1;i<=m;i++)
{
int x=read(),y=read(),c=read();
insert(x,y+1,inf,c),insert(y+1,x,0,-c);
}
while (spfa()) mcf();
cout << ans << endl;
return 0;
}