12 2020 档案

KM算法（二分图最大权匹配）
摘要：#include <bits/stdc++.h> #define N 1500 #define inf 999999999 using namespace std; int a[N],bs[N],nx=0,ny=0,k; int linky[N],lx[N],ly[N],slack[N]; int 阅读全文
posted @ 2020-12-17 22:05 _LH2000 阅读(123) 评论(0) 推荐(0)
C1. Errich-Tac-Toe (Easy Version) 米奇妙妙屋
摘要：#include<bits/stdc++.h> #include<cstdio> #include<cstring> #include<cstdlib> #include<iostream> #include<algorithm> using namespace std; #define lson 阅读全文
posted @ 2020-12-07 12:58 _LH2000 阅读(261) 评论(0) 推荐(0)