大庆油田建设集团网站,私密浏览器直播,商城小程序方案,安康手机网站建设可能再也用不到了吧#xff0c;今天整理电脑文件看到的#xff0c;作为图论选手#xff0c;留个纪念#xff0c;
//原图#xff1a; 对于pi#xff0c;拆点xi,yi s-S,[m,m],0 S-xi,[0,inf],0 yi-t,[0,inf],0 xi-yi,[vi,vi],0 对于有航线的pi和pj#x… 可能再也用不到了吧今天整理电脑文件看到的作为图论选手留个纪念
//原图 对于pi拆点xi,yi s-S,[m,m],0 S-xi,[0,inf],0 yi-t,[0,inf],0 xi-yi,[vi,vi],0 对于有航线的pi和pjyi-xj,[0,inf],cost//这样就建好了原图 那么有源汇有上下界的费用流的改造方法 首先建立附加源汇ss,tt 对于原图里有的一条边x-y,[l,r],cost变成x-y,r-l,cost 每一个点的权di定义为所有流入这个点的边的下界和-所有流出这个点的边的下界和 对于一个点i若di0ss-i,di,0若di0i-tt,-di,0 连边t-s,inf,0 然后对ss,tt做最小费用最大流 最终的费用为网络流中计算的费用原图中有费用的边的下界*这条边的费用//代码
#includealgorithm
#includeiostream
#includecstring
#includecstdio
#includecmath
#includequeue
using namespace std;
#define N 40005
#define inf 2000000000
int n,m,x,mincost,s,t,S,ss,tt;
int tot,point[N],nxt[N],v[N],remain[N],c[N];
int dis[N],last[N],d[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 nowt,ansinf;while (now!s) {ansmin(ans,remain[last[now]]);nowv[last[now]^1];}nowt;while (now!s) {remain[last[now]]-ans;remain[last[now]^1]ans;nowv[last[now]^1];}return ans;
}
bool spfa(int s,int t) {memset(dis,127,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 nowq.front();q.pop();vis[now]0;for (int ipoint[now]; i!-1; inxt[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]]) {vis[v[i]]1;q.push(v[i]);}}}if (dis[t]inf) return 0;int flowaddflow(s,t);mincostflow*dis[t];return 1;
}
int main() {tot-1;memset(point,-1,sizeof(point));scanf(%d%d,n,m);Snn1,sS1,ts1;sst1,ttss1;d[s]-m,d[S]m;for (int i1; in; i) {scanf(%d,x);addedge(S,i,inf,0);addedge(ni,t,inf,0);d[i]-x,d[ni]x;}for (int i1; in; i) for (int ji1; jn; j) {scanf(%d,x);if (x-1) continue;addedge(ni,j,inf,x);}for (int i1; it; i) {if (d[i]0) addedge(ss,i,d[i],0);if (d[i]0) addedge(i,tt,-d[i],0);}addedge(t,s,inf,0);while (spfa(ss,tt));PRintf(%d\n,mincost);
}#include queue
#include cstdio
#include cstring
#include iostream
using namespace std;
#define INF 1e9
const int N30000;
int tot-1,nxt[N],point[N],remind[N],c[N],last[N],dis[N],v[N],mincost,d[N];
bool vis[N];
void addline(int x,int y,int cap,int cc) {tot;nxt[tot]point[x];point[x]tot;v[tot]y;remind[tot]cap;c[tot]cc;tot;nxt[tot]point[y];point[y]tot;v[tot]x;remind[tot]0;c[tot]-cc;
}
int addflow(int s,int t) {int nowt,ansINF;while (now!s) {ansmin(ans,remind[last[now]]);nowv[last[now]^1];}nowt;while (now!s) {remind[last[now]]-ans;remind[last[now]^1]ans;nowv[last[now]^1];}return ans;
}
bool spfa(int s,int t) {queueintq;q.push(s);memset(dis,0x7f,sizeof(dis));memset(vis,0,sizeof(vis));dis[s]0;while (!q.empty()) {int xq.front();q.pop();vis[x]0;for (int ipoint[x]; i!-1; inxt[i])if (dis[v[i]]dis[x]c[i] remind[i]) {last[v[i]]i;dis[v[i]]dis[x]c[i];if (!vis[v[i]]) vis[v[i]]1,q.push(v[i]);}}if (dis[t]INF) return 0;int flowaddflow(s,t);mincostflow*dis[t];return 1;
}
int main() {memset(point,-1,sizeof(point));int x,n,m;scanf(%d%d,n,m);int sn*21,Ss1,tS1,sst1,ttss1;addline(s,S,m,0);
// d[s]-m; d[S]m;for (int i1; in; i) addline(S,i,INF,0),addline(in,t,INF,0);for (int i1; in; i) scanf(%d,x),d[i]-x,d[in]x;for (int i1; in; i)for (int ji1; jn; j) {scanf(%d,x);if (x!-1) addline(in,j,INF,x);}for (int i1; in; i) addline(in,t,INF,0);for (int i1; it; i) {if (d[i]0) addline(ss,i,d[i],0);if (d[i]0) addline(i,tt,-d[i],0);}addline(t,s,INF,0);while (spfa(ss,tt));printf(%d,mincost);
}
