<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[w1025758212的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/w1025758212</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; w1025758212]]></copyright><item><title><![CDATA[hdu1875]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/79016369</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/79016369</guid><author>w1025758212</author><pubDate>Tue, 09 Jan 2018 19:14:51 +0800</pubDate><description><![CDATA[畅通工程再续
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 32197    Accepted Submission(s): 10557


Problem Description
相信大家都听说一个“百岛湖”的地方吧，百岛]]></description><category></category></item><item><title><![CDATA[hdu1233还是畅通工程]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78495116</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78495116</guid><author>w1025758212</author><pubDate>Thu, 09 Nov 2017 22:58:09 +0800</pubDate><description><![CDATA[Problem Description
某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。

 

Input
测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 
当N为0时，输入结]]></description><category></category></item><item><title><![CDATA[hdu 1301 Jungle Roads（Prim算法）]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78484928</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78484928</guid><author>w1025758212</author><pubDate>Thu, 09 Nov 2017 00:53:30 +0800</pubDate><description><![CDATA[Problem Description



The 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 years ago. But the jungle overt]]></description><category></category></item><item><title><![CDATA[hdu1162 Eddy's picture（Prim算法模板）]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78484653</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78484653</guid><author>w1025758212</author><pubDate>Wed, 08 Nov 2017 23:28:34 +0800</pubDate><description><![CDATA[Problem Description
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictu]]></description><category></category></item><item><title><![CDATA[hdu1272小希的迷宫（并查集）]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78474191</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78474191</guid><author>w1025758212</author><pubDate>Wed, 08 Nov 2017 01:04:25 +0800</pubDate><description><![CDATA[Problem Description
上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。]]></description><category></category></item><item><title><![CDATA[并查集详解 (转)]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78470928</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78470928</guid><author>w1025758212</author><pubDate>Tue, 07 Nov 2017 18:34:47 +0800</pubDate><description><![CDATA[ps：作者很赞，大大的顶


并查集是我暑假从高手那里学到的一招，觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。（party：我靠，关我嘛事啊？我跟你很熟么？）

来看一个实例，杭电1232畅通工程


首先在地图上给你若干个城镇，这些城镇都可以看作点，然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整]]></description><category></category></item><item><title><![CDATA[hdu1232畅通工程（并查集）]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78470896</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78470896</guid><author>w1025758212</author><pubDate>Tue, 07 Nov 2017 18:31:03 +0800</pubDate><description><![CDATA[Problem Description
某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？


 

Input
测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N ( < 100]]></description><category></category></item><item><title><![CDATA[hdu1596 find the safest road]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78463590</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78463590</guid><author>w1025758212</author><pubDate>Tue, 07 Nov 2017 01:04:09 +0800</pubDate><description><![CDATA[Problem Description
XX星球有很多城市，每个城市之间有一条或多条飞行通道，但是并不是所有的路都是很安全的，每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0，1)，一条从u 到 v 的通道P 的安全度为Safe(P) = s(e1)*s(e2)…*s(ek) e1,e2,ek是P 上的边 ，现在8600 想出去旅游，面对这这么多的路，他想找一条最安全的路。但是86]]></description><category></category></item><item><title><![CDATA[hdu1217Arbitrage]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78090809</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78090809</guid><author>w1025758212</author><pubDate>Mon, 25 Sep 2017 23:39:35 +0800</pubDate><description><![CDATA[Problem Description
Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US D]]></description><category></category></item><item><title><![CDATA[hdu1385Minimum Transport Cost]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78089505</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78089505</guid><author>w1025758212</author><pubDate>Mon, 25 Sep 2017 21:11:16 +0800</pubDate><description><![CDATA[Problem Description
These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to ]]></description><category></category></item><item><title><![CDATA[hdu 1548 A strange lift]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78058082</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78058082</guid><author>w1025758212</author><pubDate>Thu, 21 Sep 2017 23:11:51 +0800</pubDate><description><![CDATA[Problem Description
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When yo]]></description><category></category></item><item><title><![CDATA[记忆化搜索学习]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78046846</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78046846</guid><author>w1025758212</author><pubDate>Wed, 20 Sep 2017 23:32:59 +0800</pubDate><description><![CDATA[想要学好记忆化搜索，首先先要对动态规划有一定的了解与掌握，记忆化搜索是动态规划和搜索的结合，一般用于DFS中，可以大大简化运算，降低程序的时间复杂度。其原理就是用一个数组记录下每次运算的结果，从而避免大量的重复计算。
就以POJ1163为例
             7   
          3    8      
      8    1     0     
   2    7]]></description><category></category></item><item><title><![CDATA[hdu  1142A Walk Through the Forest]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/78035407</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/78035407</guid><author>w1025758212</author><pubDate>Tue, 19 Sep 2017 22:31:25 +0800</pubDate><description><![CDATA[Problem Description
Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even n]]></description><category></category></item><item><title><![CDATA[hdu1874  畅通工程续]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/77997162</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/77997162</guid><author>w1025758212</author><pubDate>Sat, 16 Sep 2017 00:11:01 +0800</pubDate><description><![CDATA[Problem Description
某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。

现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。
 

Input
本题目包含多组数据，请处理到文件结束。
每组数据第一行包]]></description><category></category></item><item><title><![CDATA[hdu 2112 Today]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/77996562</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/77996562</guid><author>w1025758212</author><pubDate>Fri, 15 Sep 2017 22:53:01 +0800</pubDate><description><![CDATA[Problem Description
经过锦囊相助，海东集团终于度过了危机，从此，HDU的发展就一直顺风顺水，到了2050年，集团已经相当规模了，据说进入了钱江肉丝经济开发区500强。这时候，XHD夫妇也退居了二线，并在风景秀美的诸暨市浬浦镇陶姚村买了个房子，开始安度晚年了。
这样住了一段时间，徐总对当地的交通还是不太了解。有时很郁闷，想去一个地方又不知道应该乘什么公交车，在什么地方转车，在]]></description><category></category></item><item><title><![CDATA[hdu 2066一个人的旅行]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/77987129</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/77987129</guid><author>w1025758212</author><pubDate>Fri, 15 Sep 2017 00:42:34 +0800</pubDate><description><![CDATA[Problem Description
虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看雪景，去巴黎喝咖啡写信，去北京探望孟姜女……眼看寒假就快到了，这么一大段时]]></description><category></category></item><item><title><![CDATA[hdu2544 最短路]]></title><link>https://blog.youkuaiyun.com/w1025758212/article/details/77971218</link><guid>https://blog.youkuaiyun.com/w1025758212/article/details/77971218</guid><author>w1025758212</author><pubDate>Wed, 13 Sep 2017 21:22:07 +0800</pubDate><description><![CDATA[明知是最短路dijstral算法的水题，还是wa了好多发。。。。有待练习

#include
using namespace std;
#define INF 0x3f3f3f3f
int m,n,i,j,a,b,c;
int map[102][102];
int d[102];
int s[102];
void dij(){
int v,max1;
for(i=1;i
s]]></description><category></category></item></channel></rss>