题意:给出一个无向图,问,任意去掉一条边后,剩下的图可以构成环。
求出环的最小值
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#include<cstdlib>
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define cl(a,b) memset(a,b,sizeof(a));
#define LL long long
#define P pair<int,int>
#define X first
#define Y second
#define pb push_back
#define fread(zcc) freopen(zcc,"r",stdin)
#define fwrite(zcc) freopen(zcc,"w",stdout)
using namespace std;
const int maxn=1005;
const int inf=1<<28;
int w[maxn][maxn];
int linker[maxn],lx[maxn],ly[maxn],slack[maxn];
bool visx[maxn],visy[maxn];
int nx,ny;
bool dfs(int x){
visx[x]=true;
for(int i=0;i<ny;i++){
if(visy[i])continue;
int tmp=lx[x]+ly[i]-w[x][i];
if(tmp==0){
visy[i]=true;
if(linker[i]==-1||dfs(linker[i])){
linker[i]=x;
return true;
}
}else if(slack[i]>tmp){
slack[i]=tmp;
}
}
return false;
}
int km(){
cl(linker,-1);
cl(ly,0);
for(int i=0;i<nx;i++){
lx[i]=-inf;
for(int j=0;j<ny;j++)if(w[i][j]>lx[i]){lx[i]=w[i][j];}
}
for(int x=0;x<nx;x++){
fill(slack,slack+ny+1,inf);
while(true){
cl(visx,false);
cl(visy,false);
if(dfs(x))break;
int d=inf;
for(int i=0;i<ny;i++)if(!visy[i]&&slack[i]<d){
d=slack[i];
}
for(int i=0;i<nx;i++)if(visx[i])lx[i]-=d;
for(int i=0;i<ny;i++)if(visy[i])ly[i]+=d;
else slack[i]-=d;
}
}
int ans=0;
bool ok=false;
for(int i=0;i<ny;i++)if(linker[i]!=-1){
ans+=w[linker[i]][i];
if(w[linker[i]][i]==-inf)ok=true;///
}
if(ok)return 1;
return ans;
}
int main(){
int n,m;
int T;
scanf("%d",&T);
int cas=1;
while(T--){
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
w[i][j]=-inf;
}
}
for(int i=0;i<m;i++){
int x,y,v;
scanf("%d%d%d",&x,&y,&v);
x--;y--;
w[x][y]=max(w[x][y],-v);
w[y][x]=w[x][y];
}
nx=ny=n;
int ans=-km();
if(ans!=-1)
printf("Case %d: %d\n",cas++,ans);
else
printf("Case %d: NO\n",cas++);
}
return 0;
}