Ever_glow的博客

Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3015 Accepted Submission(s): 1234Problem DescriptionYour platoon of wandering lizards has entered a strange room in the labyrin

ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3561 Accepted Submission(s): 1494Problem Description　　You, the head of Department of Security, recently received a top-secret informati

SabotageThe regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperialist

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19123 Accepted: 8534DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous mea

这里是传送门1001: [BeiJing2006]狼抓兔子Time Limit: 15 Sec  Memory Limit: 162 MBSubmit: 24044  Solved: 6079[Submit][Status][Discuss]Description现在小朋友们最喜欢的"喜羊羊与灰太狼",话说灰太狼抓羊不到，但抓兔子还是比较在行的，而且现在的兔

Smallest Minimum CutTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 234 Accepted Submission(s): 64Problem DescriptionConsider a network G=(V,E) with source s and sink t. An s-t cut is a part

什么是网络流1.我自己理解的网络流我对网络流的理解就是，给定一个有向图，这个有向图有一种特点，都可以看成从某个点开始，我们称之为源点，一般情况下都将此点定位第一个点，即初始点，所有的点最终都会在一个点会和，我们称之为汇点，通常将此点定位为n，也就是最后一个点。既然是网络流，那么一定不会很简单，每条有向边之间都有一定的权值，称之为容量，用c(i,j)表示，而流过每条路径的称之为流量，用f(i