Evildoer_llc的博客

http://poj.org/problem?id=1639The Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the smalles...

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every ...

题目链接：http://poj.org/problem?id=2377Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already do...

=Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a ...

题目链接：http://poj.org/problem?id=1258DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs yo...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1162题意：给出n个点，求n个点连接或者间接连接的最小距离。最小生成树两个点！！1.多组数据，接收到EOF  （WA了好几发）2.注意double好长时间没写题，简单题都get不到点了。#pragma GCC optimize(2)#include<stdio.h>...

The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. E...

相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRush对百岛湖的情况充分了解后，决定在符合条件的小岛间建上桥，所谓符合条件，就是2个小岛之间的距离不能小于10米，也不能大于1000米。当然，为了节省资金，只要求实现任意2个小...

给定一幅无向带权连通图G = (V, E) (这里V是点集，E是边集)。从点u开始的最短路径树是这样一幅图G1 = (V, E1)，其中E1是E的子集，并且在G1中，u到所有其它点的最短路径与他在G中是一样的。现在给定一幅无向带权连通图G和一个点u。你的任务是找出从u开始的最短路径树，并且这个树中所有边的权值之和要最小。 Input单组测试数据。第一行有两个整数n和m(1 ≤...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1301The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some year...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3371In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them bec...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1875 相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRush对百岛湖的情况充分了解后，决定在符合条件的小岛间建上桥...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1863 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1233 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。     Input...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1102 There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. ...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1879 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路的费用，以及该道路是否已经修通的状态。现请你编写程序，计算出全省畅通需要的最低成本。    ...

N个点M条边的无向连通图，每条边有一个权值，求该图的最小生成树。Input第1行：2个数N,M中间用空格分隔，N为点的数量，M为边的数量。（2 <= N <= 1000, 1 <= M <= 50000)第2 - M + 1行：每行3个数S E W，分别表示M条边的2个顶点及权值。(1 <= S, E <= N，1 <= W <= 10...

题目链接：http://poj.org/problem?id=1287You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for ...