小札 Maximum Weight Closure of a Graph
1. Introduction Define a closure of a directed graph $G=(V,E)$ as an induced set of v...
Dinic Algorithm Implementation with Huge Constant, and What is Behind It
看向这样一份 Dinic 的实现：#include<bits/stdc++.h>
using namespace std;
template<typename T> st...
「loj - 3022」「cqoi 2017」老 C 的方块
link。good题，考虑像 国家集训队 - happiness 一样在棋盘上搞染色，我毛张 @shadowice1987 的图给你看啊你像这样奇数层以 red -> blue ->...
「luogu - P4313」文理分科 Mincut
link。Pretty nice practice for the min-cut trick.Starting out we eliminate the constraint that if ...
哦呼！20211127 小测
A bzoj - 3260 跳。简单且狗儿题，最多算根号次，不取模差不多得了。//how to get this one????
#include<bits/stdc++.h>
co...