摘要：
题面:https://www.luogu.org/problem/P1540 阅读全文
摘要：
题面:https://www.luogu.org/problem/P1525 cpp 本题是一个很明显的种类并查集(带权并查集),只要尽可能让危害大的罪犯在两个监狱里即可,遇到不满足条件的就输出答案. Code: include include include include using names 阅读全文
摘要：
题面:https://www.luogu.org/problem/P4144 cpp 本题中显然选大的数对答案来说更优,而同时选小的数会让答案更劣,所以ans=max{a[I]} 2; Code: include include include include using namespace std 阅读全文
摘要：
题面:https://www.luogu.org/problem/P1016 cpp 本题直接贪心之后dfs即可,注意dfs要讨论两种情况. Code: include include include include include include include using namespace s 阅读全文