![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
MaverickFW
It's Maverick
展开
-
【BZOJ1475】【网络流】方格取数 题解
1475: 方格取数Time Limit: 5 Sec Memory Limit: 64 MB Submit: 938 Solved: 465 Description在一个n*n的方格里,每个格子里都有一个正整数。从中取出若干数,使得任意两个取出的数所在格子没有公共边,且取出的数的总和尽量大。 Input第一行一个数n;(n<=30) 接下来n行每行n个数描述一个方阵 Output仅一个原创 2017-05-30 10:45:44 · 458 阅读 · 0 评论 -
【Codeforces 808F】【网络流】Card Game 题解
F. Card Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Digital collectible card games have become very popular recently. So Vova dec原创 2017-05-30 17:27:02 · 696 阅读 · 0 评论 -
【POJ2125】【网络流】【最小割】Destroying The Graph 题解
Alice and Bob play the following game. First, Alice draws some directed graph with N vertices and M arcs. After that Bob tries to destroy it. In a move he may take any vertex of the graph and remove ei原创 2017-06-07 18:41:34 · 333 阅读 · 0 评论 -
【POJ3155】【网络流】【最大密度子图】Hard Life 题解
John is a Chief Executive Officer at a privately owned medium size company. The owner of the company has decided to make his son Scott a manager in the company. John fears that the owner will ultimatel原创 2017-06-07 19:00:42 · 614 阅读 · 0 评论 -
【HDU3488】【网络流】【最小费用最大流】Tour 题解
In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be原创 2017-06-07 19:13:06 · 558 阅读 · 0 评论 -
【BZOJ2095】【最大流】[Poi2010]Bridges 题解
DescriptionYYD为了减肥,他来到了瘦海,这是一个巨大的海,海中有n个小岛,小岛之间有m座桥连接,两个小岛之间不会有两座桥,并且从一个小岛可以到另外任意一个小岛。现在YYD想骑单车从小岛1出发,骑过每一座桥,到达每一个小岛,然后回到小岛1。霸中同学为了让YYD减肥成功,召唤了大风,由于是海上,风变得十分大,经过每一座桥都有不可避免的风阻碍YYD,YYD十分ddt,于是用泡芙贿赂了你,希望你原创 2017-10-12 20:38:20 · 382 阅读 · 0 评论