liangzihao1的博客

Description In 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

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

Description Everycow'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

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

题目描述 一位冷血的杀手潜入Na-wiat，并假装成平民。警察希望能在NNN个人里面，查出谁是杀手。警察能够对每一个人进行查证，假如查证的对象是平民，他会告诉警察，他认识的人，谁是杀手，谁是平民。假如查证的对象是杀手，杀手将会把警察干掉。现在警察掌握了每一个人认识谁。每一个人都有可能是杀手，可看作他们是杀手的概率是相同的。 问：根据最优的情况，保证警察自身安全并知道谁是杀手的概率最大是多少？ ...