HDU2255 KM完全匹配模板题收藏
2016-08-03 19:39
274 查看
跟着yifan sama继续游走江湖
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXNODE = 305;
typedef int Type;
const Type INF = 0x3f3f3f3f;
struct KM {
int n;
Type g[MAXNODE][MAXNODE];
Type Lx[MAXNODE], Ly[MAXNODE], slack[MAXNODE];
int left[MAXNODE], right[MAXNODE];
bool S[MAXNODE], T[MAXNODE];
void init(int n) {
this->n = n;
}
void add_Edge(int u, int v, Type val) {
g[u][v] = val;
}
bool dfs(int i) {
S[i] = true;
for (int j = 0; j < n; j++) {
if (T[j]) continue;
Type tmp = Lx[i] + Ly[j] - g[i][j];
if (!tmp) {
T[j] = true;
if (left[j] == -1 || dfs(left[j])) {
left[j] = i;
right[i] = j;
return true;
}
} else slack[j] = min(slack[j], tmp);
}
return false;
}
void update() {
Type a = INF;
for (int i = 0; i < n; i++)
if (!T[i]) a = min(a, slack[i]);
for (int i = 0; i < n; i++) {
if (S[i]) Lx[i] -= a;
if (T[i]) Ly[i] += a;
}
}
int km() {
for (int i = 0; i < n; i++) {
left[i] = -1; right[i] = -1;
Lx[i] = -INF; Ly[i] = 0;
for (int j = 0; j < n; j++)
Lx[i] = max(Lx[i], g[i][j]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) slack[j] = INF;
while (1) {
for (int j = 0; j < n; j++) S[j] = T[j] = false;
if (dfs(i)) break;
else update();
}
}
int ans = 0;
for (int i = 0; i < n; i++)
ans += g[i][right[i]];
return ans;
}
} gao;
int n;
int main() {
while (~scanf("%d", &n)) {
gao.n = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
scanf("%d", &gao.g[i][j]);
printf("%d\n", gao.km());
}
return 0;
}
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXNODE = 305;
typedef int Type;
const Type INF = 0x3f3f3f3f;
struct KM {
int n;
Type g[MAXNODE][MAXNODE];
Type Lx[MAXNODE], Ly[MAXNODE], slack[MAXNODE];
int left[MAXNODE], right[MAXNODE];
bool S[MAXNODE], T[MAXNODE];
void init(int n) {
this->n = n;
}
void add_Edge(int u, int v, Type val) {
g[u][v] = val;
}
bool dfs(int i) {
S[i] = true;
for (int j = 0; j < n; j++) {
if (T[j]) continue;
Type tmp = Lx[i] + Ly[j] - g[i][j];
if (!tmp) {
T[j] = true;
if (left[j] == -1 || dfs(left[j])) {
left[j] = i;
right[i] = j;
return true;
}
} else slack[j] = min(slack[j], tmp);
}
return false;
}
void update() {
Type a = INF;
for (int i = 0; i < n; i++)
if (!T[i]) a = min(a, slack[i]);
for (int i = 0; i < n; i++) {
if (S[i]) Lx[i] -= a;
if (T[i]) Ly[i] += a;
}
}
int km() {
for (int i = 0; i < n; i++) {
left[i] = -1; right[i] = -1;
Lx[i] = -INF; Ly[i] = 0;
for (int j = 0; j < n; j++)
Lx[i] = max(Lx[i], g[i][j]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) slack[j] = INF;
while (1) {
for (int j = 0; j < n; j++) S[j] = T[j] = false;
if (dfs(i)) break;
else update();
}
}
int ans = 0;
for (int i = 0; i < n; i++)
ans += g[i][right[i]];
return ans;
}
} gao;
int n;
int main() {
while (~scanf("%d", &n)) {
gao.n = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
scanf("%d", &gao.g[i][j]);
printf("%d\n", gao.km());
}
return 0;
}
相关文章推荐
- hdoj 2255 奔小康赚大钱 (KM算法 详解+模板) && HDU 1533 Going Home (二分图最小权匹配 KM模板)纯模板
- One fihgt one hdu 2813 map+二分图最优匹配+KM快速模板
- hdu 2255 奔小康赚大钱(KM模板)
- KM最大匹配 HDU 2255
- HDU-2255(记录km算法的板子,km求最大权,最小权匹配)
- HDU_2255 二分图最佳完美匹配 KM匈牙利算法
- hdu2255二分最优匹配KM标准模板
- HDU2255 KM优化(n^3)模板
- hdu2255 KM模板
- HDU - 2255 奔小康赚大钱 (KM图) (KM图模板)
- hdu 2255 二分图带权匹配 模板题
- hdu 2255 二分图最大权匹配 km算法模板
- hdu 2255 - 奔小康赚大钱 ( km模板)
- HDU 2255 带权二分图 KM模板
- HDU 2255 奔小康赚大钱(KM模板)
- HDU 2255 奔小康赚大钱(二分图最优匹配:模板题)
- 【KM模板】HDU 2255 奔小康赚大钱
- hdu 2255 奔小康赚大钱 最大权匹配KM
- hdu 2255 奔小康赚大钱【KM模板题】
- HDU 1533 Going Home (二分图最小权匹配 KM模板)