摘要:
最小生成树的定义:权值和最小的连通路 krus:每一步寻找原图最短路径(但是要安全边)加入 判断安全边可以用并查集 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> 阅读全文
摘要:
Catch the Theves Problem Description A group of thieves is approaching a museum in the country of zjsxzy,now they are in city A,and the museum is in c 阅读全文
摘要:
题意:动物逃跑,从左上跑到右下角,逃跑的路径是一个grid的边,现在动物园的工作人员要去拦截。input给出了grid每条路径拦截所需要的cost,题目要求拦截成功最小的成本。 经典的最小割问题,但是400*400个点太大了,所以不能直接这么做 lrj给出的方法是动物要从左上跑到右下,所有我们考虑怎 阅读全文
摘要:
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include <queue> #incl 阅读全文
摘要:
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include <queue> #incl 阅读全文
摘要:
Halum You are given a directed graph G(V, E) with a set of vertices and edges. Each edge (i, j) that connects some vertex i to vertex j has an integer 阅读全文
摘要:
Going in Cycle!! You are given a weighted directed graph with n vertices and m edges. Each cycle in the graph has a weight, which equals to sum of its 阅读全文
摘要:
1003.杨辉三角+逆元 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include 阅读全文
摘要:
L2-1. 集合相似度 stl set模板,以后复习可以看一下,当模板用了,去重很有用呀 #include <cstdio> #include <set> using namespace std; set<int> s[50]; int main(){ //freopen("G:\\input.in 阅读全文
摘要:
A.前缀hash+逆元 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <stack> #include <string> #include < 阅读全文