摘要:
"洛咕" 给定一张$n$个点$m$条边的无向图,求两对点($s_1,t_1,s_2,t_2$)间最短路的最长公共路径.$nv$的有向边,$bj[i]$标记第i条边是否在最短路的公共路径上. cpp include include include include include include inc 阅读全文
摘要:
"洛咕" 题意:学校放假了 · · · · · · 有些同学回家了,而有些同学则有以前的好朋友来探访,那么住宿就是一个问题.比如 A 和 B 都是学校的学生,A 要回家,而 C 来看B,C 与 A 不认识.我们假设每个人只能睡和自己直接认识的人的床.那么一个解决方案就是 B 睡 A 的床而 C 睡 阅读全文
摘要:
"洛咕" 题意:如题,给出一个网络图,以及其源点和汇点,每条边已知其最大流量和单位流量费用,求出其网络最大流和在最大流情况下的最小费用.$N include include include include include include include define ll long long usi 阅读全文
摘要:
"POJ" "洛咕" 给出一个$n n$的矩阵,每一格有一个非负整数$A_{i,j},(A_{i,j} include include include include include include include define ll long long using namespace std; i 阅读全文
摘要:
"POJ" "洛咕 UVA" "洛咕 SP(输入格式稍微不同)" 题意:给定一张无向图,$n$个点$m$条边,求最少去掉多少个点,可以使图不连通.$n include include include include include include include define ll long lon 阅读全文