题意:有N个城市 M条无向边 有一恐怖分子要从某一城市到另一城市 打算在某些城市安放一些SA 去抓住他 但若在某个城市安放SA需要一定费用 求要抓到恐怖分子 最少的费用是多少?
思路:网络流问题。建一超级源点和汇点与原源点、汇点相连,然后把一个城市拆成两个点 边权为其费用 两相连城市间的边权为无穷大
#include<cstdio>
#include<iostream>
#include<memory.h>
#define maxn 1002
#define maxm 205000
#define inf 1<<29
using namespace std;
int gap[maxn],dis[maxn],pre[maxn],cur[maxn];
int n,NV,m;
struct Edge
{
int v,val;
int next;
Edge() {}
Edge( int V , int NEXT , int W = 0 ):v(V),next(NEXT),val(W) {}
} edge[maxm];
int cnt_edge,head[maxn];
void addEdge( int u , int v , int flow = 0 )
{
edge[cnt_edge] = Edge(v,head[u],flow);
head[u] = cnt_edge++;
edge[cnt_edge] = Edge(u,head[v]);
head[v] = cnt_edge++;
}
void Init()
{
cnt_edge = 0;
memset(head,-1,sizeof(int)*(NV+1));
}
int Sap( int st, int en )
{
memset(dis,0,sizeof(int)*( NV+1));
memset(gap,0,sizeof(int)*( NV+1));
for( int i = 0 ; i < NV ; i++ )
cur[i] = head[i];
int u = pre[st] = st,maxflow = 0,aug = inf;
gap[0] = NV;
while( dis[st] < NV )
{
loop:
for( int &i = cur[u]; i != -1 ; i = edge[i].next )
{
int v =edge[i].v;
if( edge[i].val && dis[u] == dis[v]+1)
{
aug = aug < edge[i].val? aug: edge[i].val;
pre[v] = u;
u = v;
if( v == en )
{
maxflow += aug;
for( u = pre[u]; v != st ; v = u,u = pre[u] )
{
edge[cur[u]].val -= aug;
edge[cur[u]^1].val += aug;
}
aug = inf;
}
goto loop;
}
}
int mindis = NV;
for( int i = head[u]; i != -1 ; i = edge[i].next )
{
int v = edge[i].v;
if( edge[i].val && mindis > dis[v] )
{
cur[u] = i;
mindis = dis[v];
}
}
if( --gap[dis[u]] == 0 ) break;
gap[ dis[u] = mindis+1 ]++;
u = pre[u];
}
return maxflow;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
int st,ed,val;
scanf("%d%d",&st,&ed);
NV = 2*n+2;
int S = 0;
int T = 2 * n + 1;
Init();
addEdge(S,st,inf);
addEdge(ed+n,T,inf);
for( int i = 1 ; i <= n ; i++ )
{
scanf("%d",&val);
addEdge(i,i+n,val);
}
int a,b;
while(m--)
{
scanf("%d%d",&a,&b);
addEdge(a+n,b,inf);
addEdge(b+n,a,inf);
}
printf("%d\n",Sap(S,T));
}
return 0;
}