摘要：
题意: 给出一个方格取数,最多能取k次,问最多能取到多少 思路: 最大费用最大流 cpp include include include include include include include include define ll long long using namespace std; 阅读全文
摘要：
线性约束 将所有不等式化成 $d[a] d[b] include include include include define ll long long using namespace std; typedef pair pii; const int N = 1e5+10; const int in 阅读全文
摘要：
C 题意: 有两种管子(直和弯的),给出一个由这两种管子构成的$n 2$的矩阵,问能不能通过任意调整管子的朝向使得左上角能走到右下角. 思路: 直管只能直着走,弯管必须上下都是弯管才能向前走,且要走到另外一层. 阅读全文