2016年06月_Amber_lylovely

原创 poj 3177（桥）

DescriptionIn order to get from one of the F (1 <=F <= 5,000) grazing fields (which are numbered 1..F) to another field,Bessie and the rest of the herd are forced to cross near the Tree of RottenApp

2016-06-25 11:34:09 223 2

原创 poj 1144 (tju 1026)

DescriptionATelephone Line Company (TLC) is establishing a new telephone cable network.They are connecting several places numbered by integers from 1 to N . No twoplaces have the same number. The li

2016-06-25 10:11:05 242 2

原创备用交换机

题目：备用交换机问题描述n个城市之间有通讯网络，每个城市都有通讯交换机，直接或间接与其它城市连接。因电子设备容易损坏，需给通讯点配备备用交换机。但备用交换机数量有限，不能全部配备，只能给部分重要城市配置。于是规定：如果某个城市由于交换机损坏，不仅本城市通讯中断，还造成其它城市通讯中断，则配备备用交换机。请你根据城市线路情况，计算需配备备用交换机的城市个数，及需配备备用交换机城市的编号。

2016-06-24 21:38:29 728 2

原创信与信封问题

问题描述：John先生晚上写了n封信，并相应地写了n个信封将信装好，准备寄出。但是，第二天John的儿子Small John将这n封信都拿出了信封。不幸的是，Small John无法将拿出的信正确地装回信封中了。编程任务：将Small John所提供的n封信依次编号为1，2，…，n；且n个信封也依次编号为1，2，…，n。假定Small John能提供一组信息：第i封信肯定不是装在

2016-06-22 13:12:48 664 1

原创匹配（工作分配问题）

设有M个工人x1,x2, …, xm，和N项工作y1,y2, …, yn，规定每个工人至多做一项工作，而每项工作至多分配一名工人去做。由于种种原因，每个工人只能胜任其中的一项或几项工作。问应怎样分配才能使尽可能多的工人分配到他胜任的工作。这个问题称为人员分配问题。人员分配问题可以用图的语言来表述。令X={x1, x2, …, xm}，Y={y1, y2, …,yn}，构造二分图G=(X, Y,

2016-06-16 17:09:10 712 2

原创 poj 2749

DescriptionFarmerJohn's farm has N barns, and there are some cows that live in each barn. Thecows like to drop around, so John wants to build some roads to connect thesebarns. If he builds roads for

2016-06-13 19:41:18 287 2

原创 poj 2723

DescriptionRatish isa young man who always dreams of being a hero. One day his friend Luffy wascaught by Pirate Arlong. Ratish set off at once to Arlong's island. When he gotthere, he found the secr

2016-06-12 17:18:03 370 2

原创 poj 3207

Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki.Today after minesweeping with Ikki and winning so many times, he is tired ofsuch easy games and wants to play another game w

2016-06-10 19:57:12 340 2

原创 poj 3678

DescriptionKatu Puzzle ispresented as a directed graph G(V, E) with eachedge e(a, b) labeled by a boolean operator op (oneof AND, OR, XOR) and an integer c (0 ≤ c ≤1). One Katu is solvable if one

2016-06-06 20:04:08 367 2

原创 2-SAT问题浅介绍

关于2-SAT问题：定义：对于数组A每个Ai，数组B都有一个Bi于其相反，也就是说选Ai就一定不能选Bi。构图：若a和b冲突，即选a时不能选b，那么选a时必须选!b（因为不选b就必须选!b，这是一个2- SAT问题必须满足的条件），那么我们就连边。同样的道理，如果选了b，那么就不能选a，必须选!a，所以连边。这样的连边，显然是对称的。求解：给所构的图G进行一次强连通

2016-06-06 19:52:35 284 2

原创 poj 2186

DescriptionEverycow's dream is to become the most popular cow in the herd. In a herd of N (1<= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000)ordered pairs of the form (A, B) that tell y

2016-06-05 20:41:32 269 2

DescriptionA numberof schools are connected to a computer network. Agreements have been developedamong those schools: each school maintains a list of schools to which itdistributes software (the “rece

2016-06-04 11:53:47 387 2

原创 poj 2182

DescriptionN (2 <=N <= 8,000) cows have unique brands in the range 1..N. In a spectaculardisplay of poor judgment, they visited the neighborhood 'watering hole' anddrank a few too many beers before

2016-06-01 17:18:32 340 2

liangzihao1的博客