网络流
文章平均质量分 51
小九_
这个作者很懒,什么都没留下…
展开
-
hdu 1068
自己写的板子就是好用,这道题是求的最大独立集不是最大匹配(英语弱渣),没看懂题调了半天代码找不到错。。GG最大独立集 = n - (最大匹配 / 2)#include<iostream>#include<vector>#include<memory.h>#include<algorithm>using namespace std;...原创 2018-08-15 15:39:06 · 231 阅读 · 0 评论 -
hdu 1150
Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature...原创 2018-08-15 16:23:00 · 213 阅读 · 0 评论 -
hdu 1281
棋盘游戏 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submissi...原创 2018-08-15 21:10:46 · 205 阅读 · 0 评论 -
HDU Flow Problem
Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. InputThe first line o...原创 2018-08-13 17:29:30 · 345 阅读 · 0 评论