最大权闭合子图,具体请看《最小割模型在信息学竞赛中的应用》。
首先建图,原图的边都保存,并把边权置为无限大,要用long long 来存,权值为正的点与源点相连,把权值置为边权,权值为负的点与汇点相连,把权值的相反数置为边权。
然后跑一边最大流,再进行dfs,所有能搜到的点即为要炒掉的人。
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
ll INF;
int s=0,t=5001;
const int maxnode = 5000 + 5;
const int maxedge = 2*60005 + 5;
const int oo = 1000000000;
int node, src, dest, nedge;
int head[maxnode], point[maxedge], next1[maxedge];
ll flow[maxedge], capa[maxedge];//point[x]==y表示第x条边连接y,head,next为邻接表,flow[x]表示x边的动态值,capa[x]表示x边的初始值
int dist[maxnode], Q[maxnode], work[maxnode];//dist[i]表示i点的等级
void init(int _node, int _src, int _dest){//初始化,node表示点的个数,src表示起点,dest表示终点
node = _node;
src = _src;
dest = _dest;
for (int i = 0; i < node; i++) head[i] = -1;
nedge = 0;
}
void addedge(int u, int v, ll c1, int c2){//增加一条u到v流量为c1,v到u流量为c2的两条边
point[nedge] = v, capa[nedge] = c1, flow[nedge] = 0, next1[nedge] = head[u], head[u] = (nedge++);
point[nedge] = u, capa[nedge] = c2, flow[nedge] = 0, next1[nedge] = head[v], head[v] = (nedge++);
}
bool dinic_bfs(){
memset(dist, 255, sizeof (dist));
dist[src] = 0;
int sizeQ = 0;
Q[sizeQ++] = src;
for (int cl = 0; cl < sizeQ; cl++)
for (int k = Q[cl], i = head[k]; i >= 0; i = next1[i])
if (flow[i] < capa[i] && dist[point[i]] < 0){
dist[point[i]] = dist[k] + 1;
Q[sizeQ++] = point[i];
}
return dist[dest] >= 0;
}
ll dinic_dfs(int x, ll exp){
if (x == dest) return exp;
for (int &i = work[x]; i >= 0; i = next1[i]){
int v = point[i];
ll tmp;
if (flow[i] < capa[i] && dist[v] == dist[x] + 1 && (tmp = dinic_dfs(v, min(exp, capa[i] - flow[i]))) > 0){
flow[i] += tmp;
flow[i^1] -= tmp;
return tmp;
}
}
return 0;
}
ll dinic_flow(){
ll result = 0;
while (dinic_bfs()){
for (int i = 0; i < node; i++) work[i] = head[i];
while (1){
ll delta = dinic_dfs(src, oo);
if (delta == 0) break;
result += delta;
}
}
return result;
}
//建图前,运行一遍init();
//加边时,运行addedge(a,b,c,0),表示点a到b流量为c的边建成(注意点序号要从0开始)
//求解最大流运行dinic_flow(),返回值即为答案
bool vis[maxnode];
void dfs(int u)
{
if(u==t) return ;
int v,i;
vis[u]=1;
for(i=head[u];i!=-1;i=next1[i]){
v=point[i];
if(!vis[v] && capa[i]>flow[i]){
vis[v]=1;
dfs(v);
}
}
}
int main()
{
int n,m,i;
ll sum=0;
int b;
scanf("%d%d",&n,&m);
init(n+2,s,t);
for(i=1;i<=n;i++){
scanf("%d",&b);
if(b>0){
addedge(s,i,b,0);
sum+=b;
}
else{
addedge(i,t,-b,0);
}
}
INF=sum+1;
int u,v;
for(i=1;i<=m;i++){
scanf("%d%d",&u,&v);
addedge(u,v,INF,0);
}
sum-=dinic_flow();
dfs(s);
int ans=0;
for(i=1;i<=n;i++){
if(vis[i]) ans++;
}
printf("%d %I64d\n",ans,sum);
return 0;
}