Elijahqi

http://www.elijahqi.win/2017/12/15/poj2594treasure-exploration/ ‎ Description Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you

http://www.elijahqi.win/archives/1176 题目描述 A charity festival is taking place in Byteburg, and you are one of the fundraisers. Unfortunately you have missed some fun activities, including a steepl...

http://www.elijahqi.win/archives/3276 给定一个DAG 可以用n+1条路径覆盖求不能覆盖的点中最小值最大 出题人的语文水平+elijahqi的语文水平为负无穷 读错题只有10分系列 考虑二分答案 然后二分图匹配 求最小可相交路径覆盖问题 注意二分答案的单调性 即 若3->6之间有一个8 然而这次二分的答案是7 他们这条边也应该视为存在 #in...

http://www.elijahqi.win/archives/933 Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves p...

http://www.elijahqi.win/archives/878 题目背景 [Usaco2008 Jan] 题目描述 N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better t...

http://www.elijahqi.win/archives/872 Description There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the tow...

http://www.elijahqi.win/archives/870 Description Farmer John 想让她的奶牛准备郡级跳跃比赛，贝茜和她的伙伴们正在练习跨栏。她们很累，所以她们想消耗最少的能量来跨栏。 显然，对于一头奶牛跳过几个矮栏是很容易的，但是高栏却很难。于是，奶牛们总是关心路径上最高的栏的高度。 奶牛的训练场中有 N (1 ≤ N ≤ 300) 个站台，分别标记...

http://www.elijahqi.win/archives/865 题目描述 在社交网络（social network）的研究中，我们常常使用图论概念去解释一些社会现象。不妨看这样的一个问题。在一个社交圈子里有n个人，人与人之间有不同程度的关系。我 们将这个关系网络对应到一个n个结点的无向图上，两个不同的人若互相认识，则在他们对应的结点之间连接一条无向边，并附上一个正数权值c，c越小，表...

http://www.elijahqi.win/archives/863 题目描述 Farmer John is on a boat seeking fabled treasure on one of the N (1 <= N <= 100) islands conveniently labeled 1..N in the Cowribbean Sea. The treasur...

http://www.elijahqi.win/2017/07/10/luogu-2009/ ‎ 题目背景 跑步是一项有意思的运动，尤其是可以开发人的脑筋。常神牛很喜欢跑步。 题目描述 常神牛跑步的场地是一个多边形（边数≤20，每个顶点用英文大写字母表示），并且在这个多边形内部，还会有一些小道，连接两个不相邻的顶点。所有的边长和小道都是双向通行的举例来说，下面一个图： 假设常神牛从A点...

http://www.elijahqi.win/2018/01/08/zoj-2760-how-many-shortest-path/ ‎ Given a weighted directed graph, we define the shortest path as the path who has the smallest length among all the path connectin

http://www.elijahqi.win/2018/01/07/bzoj1143-ctsc2008%e7%a5%ad%e7%a5%80river/ Description 　　在遥远的东方，有一个神秘的民族，自称Y族。他们世代居住在水面上，奉龙王为神。每逢重大庆典， Y族都 会在水面上举办盛大的祭祀活动。我们可以把Y族居住地水系看成一个由岔口和河道组成的网络。每条河道连接着 两个岔口

http://www.elijahqi.win/archives/1582 Dima took up the biology of bacteria, as a result of his experiments, he invented k types of bacteria. Overall, there are n bacteria at his laboratory right now...