摘要：
可证贪心运送到中间的仓库最优，因为只能运送到相邻的仓库 证明：http://www.cnblogs.com/five20/p/8869948.html cpp //Writer:jr HSZ;%%%WJMZBMR include define int long long define reg reg 阅读全文
摘要：
最大独立集 套路题 cpp include include include include using namespace std; const int S=0,T=40005,inf=0x7f7f7f7f; bool g[205][205]; int n,m,ecnt=1,h[Tq; q.push 阅读全文
摘要：
贪心 反证法 放在旧的柱子上一定比新开一个优 cpp include include include std::vector d[60]; int n,ans=1,cnt; bool sqr[5005]; int main() { scanf("%d",&n); for(int i=1;i i 阅读全文
摘要：
多重匹配+输出方案 套路题 cpp include include include include using namespace std; int n,k,s,m; int a,b,c; const int N = 5000; int h[Nq; q.push(0); h[0]=0; while( 阅读全文
摘要：
最大权闭合子图问题 ans=sum maxflow 套路题 cpp //Writer:jr HSZ;%%%WJMZBMR include include include include include include include define LL long long using namespa 阅读全文
摘要：
二分图匹配即可水过 没什么可说的 cpp //Writer:jr HSZ;%%%WJMZBMR include define LL long long define reg register int define f(i,a,b) for(reg i=a;i n m; for(;;) { scanf 阅读全文