我是題目啊
這個題一看到求最小費用就想最小費用最大流,然後也沒看懂題。。。
其實是求去掉幾個頂點使s到t不連通,很明顯最小割,然後就是建圖,由于是去掉頂點,是以将每個點拆成兩個點,容量即為這個點的花費,然後是每兩個有關系的點相連,為了保證最後是一個環,是以,最後的圖:
代碼:
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <vector>
#include <queue>
using namespace std;
const int N = ;
const int INF = ;
struct edge
{
int to, cap, next;
} g[N*];
int level[N], iter[N], head[N], que[N];
int n, m, cnt;
void add_edge(int v, int u, int cap)
{
g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
g[cnt].to = v, g[cnt].cap = , g[cnt].next = head[u], head[u] = cnt++;
}
bool bfs(int s, int t)
{
memset(level, -, sizeof level);
level[s] = ;
int st = , en = ;
que[] = s;
while(st <= en)
{
int v = que[st++];
for(int i = head[v]; i != -; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > && level[u] < )
{
level[u] = level[v] + ;
que[++en] = u;
}
}
}
return level[t] == -;
}
int dfs(int v, int t, int f)
{
if(v == t) return f;
int tm = f;
for(int &i = iter[v]; i != -; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > && level[v] < level[u])
{
int d = dfs(u, t, min(tm, g[i].cap));
g[i].cap -= d, g[i^].cap += d, tm -= d;
if(tm == ) break;
}
}
if(tm == f) level[v] = -;
return f - tm;
}
int dinic(int s, int t)
{
int flow = , f;
while(true)
{
if(bfs(s, t)) return flow;
memcpy(iter, head, sizeof head);
flow += dfs(s, t, INF);
}
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
cnt = ;
memset(head, -, sizeof head);
int s,t;
scanf("%d%d",&s,&t);
int x;
for(int i = ; i <= n; i++)
{
scanf("%d",&x);
add_edge(i,i+n,x);
}
t=t+n;
int a,b;
for(int j = ; j <=m; j++)
{
scanf("%d%d",&a,&b);
add_edge(a+n, b,INF);
add_edge(b+n, a,INF);
}
printf("%d\n", dinic(s,t));
}
}