beat anyone if necessary

直接模板 #include using namespace std; const int maxn=20; const int inf=0x3f3f3f3f; struct EK { int cap[maxn][maxn]; int flow[maxn][maxn]; int n; void init(int n) { this->n=n

http://acm.timus.ru/problem.aspx?space=1&num=1016 http://acm.hust.edu.cn:8080/judge/problem/viewProblem.action?id=14076 1016. Cube on the Walk Time Limit: 2.0 second Memory Limit: