Lord_sh的博客

https://blog.youkuaiyun.com/code4101/article/details/40748663 我的知乎刷题收藏专栏 QQacfun群 http://exp-blog.com/2018/06/28/pid-38/ 二分图的最大匹配 （匈牙利算法） 未做 最大流的增广路算法（压入重标法、KM算法） 未做 不要在乎名次，掌握思维方式，才是最重要的 ...

题目context真傻逼欸，还有拆塔加强防御的 https://cn.vjudge.net/problem/UVA-1471 O(nlogn) // https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch8/UVa1471.cpp // UVa1471 Defense Lines // Rujia Liu // Algorit...

P351

https://vjudge.net/problem/UVA-1603 // https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa1603.cpp // UVa1603 Square Destroyer // Rujia Liu // This code implements a variant of an alg...

https://vjudge.net/problem/UVA-1602 // https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa1602.cpp // UVa1602 Lattice Animals // Rujia Liu #include<cstdio> #include<cstring&g...

// UVa1343 The Rotation Game // Rujia Liu // This solutions uses IDA* instead of BFS described in the book, because it's shorter 8-) // It's shorter because no need for lookup tables and "automati...

骚题，看了半天。以后还是要思维更直白点。 // https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa12325.cpp // UVa12325 Zombie's Treasure Chest // Rujia Liu #include<cstdio> #include<algorithm> u...

1. d为当前深度，maxd为深度限制，因为每次剪切时h最多减少3，所以 时剪枝 的意思是消除h个后继不正确的数字，至少需要步 2. 为何h每次剪切最多减少3 // https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa11212.cpp // UVa11212 Editing a Book // Rujia...

https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/egypt.cpp#L60 // 埃及分数问题 // Rujia Liu #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #in...

被注释代码来自： https://www.cnblogs.com/npugen/p/9539734.html INPUT OUTPUT For each dataset in the input, one line containing the smallest number of steps to restore ghosts into the positions where t...

// https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa10603.cpp // UVa10603 Fill // Rujia Liu #include<cstdio> #include<cstring> #include<queue> using namespace std; str...

//https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa1354.cpp // UVa1354 Mobile Computing // Rujia Liu #include<cstdio> #include<cstring> #include<vector> using namespace...

题目都没写。。。 题目等转自https://www.cnblogs.com/devymex/p/3264538.html Time limit: 3.000 seconds 限时3.000秒 Problem 问题 Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an o...

poj 2109 power of cryptography 指数的位数为什么可以由两个数的商决定