摘要:
12549 - Sentry RobotsTime limit: 1.000 secondsWe need to guard a set of points of interest using sentry robots that cannot move or turn. We can positi... 阅读全文
摘要:
1349 - Optimal Bus Route DesignTime limit: 3.000 secondsA big city wants to improve its bus transportation system. One of the improvement is to add sc... 阅读全文
摘要:
在网上找了一份挺好的模板,先标一下哦~链接君:http://blog.csdn.net/abcjennifer/article/details/5844579#include #include #include #include using namespace std;int max(int a,i... 阅读全文
摘要:
题意:在一个三维的奶酪里面有n(n#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#defi... 阅读全文
摘要:
题意:平面上有n个点(1#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define ll... 阅读全文
摘要:
题意:一个带权有向图,求起点到终点的两条路径权值之和最小,且两条路径没有公共点(除起点,终点);分析:拆点法,将u拆成u和u',u-u'容量为1,费用为0,这样就能保证每个点只用一次,起点s-s'容量为2,终点t-t'容量为2保证最大流会求出两条路径,若输入u-v,权为c,则增加边u'-v,容量为1... 阅读全文
摘要:
Cable TV NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:4267Accepted:2003DescriptionThe interconnection of the relays in a cable TV netw... 阅读全文
摘要:
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12771Accepted Submission(s): 6097P... 阅读全文
摘要:
Cutting ChainsWhat a find! Anna Locke has just bought several links of chain some of which may be connected. They are made from zorkium, a material th... 阅读全文