自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(31)
  • 资源 (2)
  • 收藏
  • 关注

原创 lightoj 1198 Karate Competition(费用流)

1198 - Karate Competition    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Your karate club challenged another karate club in your town. Each club enters...

2018-08-31 18:43:23 179

原创 lightoj 1243 - Guardian Knights(费用流)

1243 - Guardian Knights    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB The kingdom of Azkaroth is in great danger. Some strange creatures have captured...

2018-08-31 17:07:16 199

原创 lightoj 1071 Baker Vai(费用流)

1071 - Baker Vai    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB All of you must have heard the name of Baker Vai. Yes, he rides a bike and likes to hel...

2018-08-30 22:51:50 176

原创 lightoj 1405 The Great Escape(网络流+建图)

1405 - The Great Escape    PDF (English) Statistics Forum Time Limit: 5 second(s) Memory Limit: 32 MB Walter White finally discovered the medicine for a dangerous disease. That's why...

2018-08-30 12:06:43 156

原创 lightoj 1330 Binary Matrix(网络流)

1330 - Binary Matrix    PDF (English) Statistics Forum Time Limit: 3 second(s) Memory Limit: 32 MB A binary matrix is an m x n matrix consisting of only zeroes and ones. Now you are ...

2018-08-29 13:41:51 403

原创 lightoj 1222 Gift Packing(费用流)

1222 - Gift Packing    PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB There are n gifts and n boxes, each box can contain at most one gift. Now you want t...

2018-08-28 22:33:10 247

原创 lightoj 1176 Getting a T-shirt(网络流)

1176 - Getting a T-shirt    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB In programming contests, a common problem for the contestants is to get a suite...

2018-08-28 20:36:59 211

原创 LightOJ 1155 Power Transmission(网络流)

1155 - Power Transmission    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB DESA is taking a new project to transfer power. Power is generated by the newl...

2018-08-28 19:10:51 233

原创 lightoj 1153 Internet Bandwidth(无向图最大流)

1153 - Internet Bandwidth    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB On the Internet, machines (nodes) are richly interconnected, and many paths ma...

2018-08-28 16:35:24 791 1

原创 HDU 5889 Barricade(最小割+最短路)

BarricadeTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2340    Accepted Submission(s): 677 Problem DescriptionThe empire is under atta...

2018-08-27 22:45:39 172

原创 Lightoj 1152 Hiding Gold(二分图匹配)

1152 - Hiding Gold    PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You are given a 2D board where in some cells there are gold. You want to fill the boa...

2018-08-27 08:23:23 216

原创 51nod 1179 最大的最大公约数(思维)

1179 最大的最大公约数题目来源: SGU基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注给出N个正整数,找出N个数两两之间最大公约数的最大值。例如:N = 4,4个数为:9 15 25 16,两两之间最大公约数的最大值是15同25的最大公约数5。Input第1行:一个数N,表示输入正整数的数量。(2 <= N &...

2018-08-26 21:42:14 155

原创 HDU 6437 Videos(费用流)

Problem L.VideosTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 665    Accepted Submission(s): 327 Problem DescriptionC-bacteria takes...

2018-08-24 16:31:14 448

原创 HDU 3879 Base Station(最大权闭合图)

 Base StationTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65768/32768 K (Java/Others)Total Submission(s): 2929    Accepted Submission(s): 1259 Problem DescriptionA famous mobile c...

2018-08-20 10:59:27 182

原创 POJ 2987 Firing(最大权闭合图)

                                                                                              FiringTime Limit: 5000MS   Memory Limit: 131072K Total Submissions: 11800   Accepted: 3579...

2018-08-20 08:55:32 192

原创 UVA 10480 Sabotage (输出最小割的边)

题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1421题目大意:求最小割的割边正常的跑一遍最大流,然后dfs去找能与源点相连的点,最后遍历输入的边来找最小割即可#include<iostream&gt...

2018-08-20 08:33:33 237

原创 HDU 2732 Leapin' Lizards(网络流+建图)

Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3742    Accepted Submission(s): 1535 Problem DescriptionYour platoon of w...

2018-08-15 09:32:05 159 1

原创 codeforces 449B Jzzhu and Cities(最短路)

B. Jzzhu and Citiestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu is the president of country A. There are n cities numbe...

2018-08-13 10:45:37 391

原创 UVA 11248 Frequency Hopping(最小割)

题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2205题目大意:给一个有向网络,每条边均有一个容量,问是否存在一个点从点1到点N,流量为C的流,如果不存在,是否可以恰好修改一条弧的容量,使得存在一条这样的流这道题...

2018-08-12 19:14:40 217

原创 SPOJ SCITIES - Selfish Cities(费用流)

SCITIES - Selfish Cities#combinatorics #weighted-matching Far, far away there is a world known as Selfishland because of the nature of its inhabitants. Hard times have forced the cities of Selfi...

2018-08-10 13:09:02 254

原创 SPOJ GREED - Greedy island(费用流)

GREED - Greedy island#max-flow #minimum-cost-flow Gon is on Greedy island. He wants to go home. But to get the ticket to leave the game, he has to get N cards labeled in a sequence from 1 to N (...

2018-08-09 20:41:28 259

原创 SPOJ SPHIWAY - Two "Ways"(费用流)

SPHIWAY - Two "Ways"no tags  There are N places and M bidirectional way. No two places have more than one direct way. Ana wants to walk from S to T and return to S by a itinerary that satisfy:...

2018-08-09 19:35:18 201

原创 HDU 6349 三原色图(最小生成树)

三原色图Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 270    Accepted Submission(s): 111 Problem Description度度熊有一张 n 个点 m 条边的无向图,所有点按照 1...

2018-08-08 09:44:15 306

原创 POJ 3422 Kaka's Matrix Travels(费用流)

Kaka's Matrix TravelsTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10445   Accepted: 4253 DescriptionOn an N × N chessboard with a non-negative number in each grid, ...

2018-08-05 21:11:50 145

原创 POJ 2135 Farm Tour(费用流)

Farm TourTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19376   Accepted: 7527 DescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His f...

2018-08-05 19:42:57 186

原创 POJ 2195 Going Home(费用流或km算法)

Going HomeTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 25067   Accepted: 12560 DescriptionOn a grid map there are n little men and n houses. In each unit time, ever...

2018-08-05 10:10:04 204

原创 HDU 6299 Balanced Sequence(贪心)

Balanced SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5424    Accepted Submission(s): 1401Problem DescriptionChiaki has n stri...

2018-08-03 18:55:20 120

原创 HDU 6331 Walking Plan(最短路+dp+分块思想)

Problem M. Walking PlanTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 897    Accepted Submission(s): 328 Problem DescriptionThere are...

2018-08-03 09:17:32 278

原创 HDU 6336 Matrix from Arrays(找规律)

Problem E. Matrix from ArraysTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 884    Accepted Submission(s): 396 Problem DescriptionKaz...

2018-08-02 20:08:34 217

原创 HDU 3416 Marriage Match IV(最大流+最短路)

Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5225    Accepted Submission(s): 1549 Problem DescriptionDo not sincere ...

2018-08-02 10:17:21 150

原创 HDU 5876 Sparse Graph(补图最短路)

 Sparse GraphTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2746    Accepted Submission(s): 942 Problem DescriptionIn graph theory,...

2018-08-01 10:13:02 158

TCP/IP网络编程 [韩] 尹圣雨(带书签)

第一部分主要介绍网络编程基础知识。此部分主要论述Windows和Linux平台网络编程必备基础知识,未过多涉及不同操作系统特性。 第二部分和第三部分与操作系统有关。第二部分主要是Linux相关内容,而第三部分主要是Windows相关内容。从事Windows编程的朋友浏览第二部分内容后,同样可以提高技艺。 第四部分对全书内容进行总结,包含了作者在自身经验基础上总结的学习建议,还介绍了网络编程经典书籍

2019-04-19

浅析最大最小定理在信息学竞赛中的应用--周冬

周冬神犇的浅析最大最小定理在信息学竞赛中的应用,网络流,分数规划...

2018-06-10

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除