题意:有个X矩阵和C矩阵,给你C矩阵,让你求the minimum of ∑Cij*Xij(1<=i,j<=n),X矩阵满足要求:
1.X12+X13+...X1n=1
2.X1n+X2n+...Xn-1n=1
3.for each i (1<i<n), satisfies ∑Xki (1<=k<=n)=∑Xij (1<=j<=n).
把Xij理解成i和j是否联通,
三个条件分别转化为图的概念:
1号点的出度为0,n号点的入度为0,
其他点入度和出度相等。
而Cij则可以代表花费(边长),所以我们最终要求的是
1.1~n的最短路径
2.1的自环+n的自环
两者再取最小值
#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 305;
int n,C[N][N],dis[N],vis[N];
int spfa(int s,int t,int &res)
{
queue<int> q;
for(int i = 0;i <= n;i++)
dis[i] = INF;
memset(vis,0,sizeof(vis));
dis[s] = 0;
q.push(s);
while(!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = 1;i <= n;i++)
{
if(s != u && i == s)
res = min(res,C[u][i] + dis[u]);
if(dis[i] > dis[u] + C[u][i])
{
dis[i] = dis[u] + C[u][i];
if(!vis[i])
q.push(i);
vis[i] = 1;
}
}
}
return dis[t];
}
int main()
{
while(~scanf("%d",&n))
{
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
scanf("%d",&C[i][j]);
int res1 = INF;
int ans = spfa(1,n,res1);
int res2 = INF;
spfa(n,1,res2);
printf("%d\n",min(ans,res1+res2));
}
}