<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[唐图图的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/acmtl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; acmtl]]></copyright><item><title><![CDATA[java 9 在Windows10中的设置]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/79461178</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/79461178</guid><author>acmtl</author><pubDate>Tue, 06 Mar 2018 17:32:48 +0800</pubDate><description><![CDATA[java 9 的设置与前面版本的设置并不一样所以在网上solo半天，终于找到了方法java 9之前的设置是 .;%JAVA_HOME%\lib;%JAVA_HOME%\lib\tools.jar然而java9的lib目录下没有找到我们常见的两个jar包，这就很尴尬了现在就是重新设置classpath变量我的jdk安装在 d盘 java文件里 同时里面还有一个 jre所以参考路径 classpath...]]></description><category></category></item><item><title><![CDATA[poj1797 - Heavy Transportation（标准的Dijkstra模板题）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/56845116</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/56845116</guid><author>acmtl</author><pubDate>Fri, 24 Feb 2017 16:57:16 +0800</pubDate><description><![CDATA[题目大意：有n个城市，m条道路，在每条道路上有一个承载量，现在要求从1到n城市最大承载量，而最大承载量就是从城市1到城市n所有通路上的最大承载量
#include
#include
#define MAXV 1010
#define min(a,b) (a<b?a:b)
using namespace std;


int map[MAXV][MAXV],n,m;

int dijkstra()]]></description><category></category></item><item><title><![CDATA[poj3268 - Silver Cow Party（dijkstra）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/56844953</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/56844953</guid><author>acmtl</author><pubDate>Fri, 24 Feb 2017 16:52:54 +0800</pubDate><description><![CDATA[题目大意：给出n个点和m条边，接着是m条边，代表从牛a到牛b需要花费c时间，现在所有牛要到牛x那里去参加聚会，并且所有牛参加聚会后还要回来，给你牛x，除了牛x之外的牛，他们都有一个参加聚会并且回来的最短时间，从这些最短时间里找出一个最大值输出
到牛x的距离是最短路程 回来的时候再算一遍 只需要把地图横纵轴交换一下位置就行了  最后再加上2段路程选出最大值就好了




#include]]></description><category></category></item><item><title><![CDATA[B - 下沙小面的(2) （DFS）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54576083</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54576083</guid><author>acmtl</author><pubDate>Mon, 16 Jan 2017 17:44:34 +0800</pubDate><description><![CDATA[前文再续，书接上一题。话说当上小面的司机的Lele在施行他的那一套拉客法则以后，由于走的路线太长，油费又贵，不久便亏本了。(真可怜～)于是他又想了一个拉客的办法。


对于每一次拉客活动，他一次性把乘客都拉上车(当然也不会超过7个，因为位置只有7个)。然后，Lele计算出一条路线(出于某些目的，Lele只把车上乘客的目的地作为这条路线上的站点），把所有乘客都送到目的地(在这路线上不拉上其他乘]]></description><category></category></item><item><title><![CDATA[G - 诡异的楼梯 （优先队列 BFS）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54576060</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54576060</guid><author>acmtl</author><pubDate>Mon, 16 Jan 2017 17:42:58 +0800</pubDate><description><![CDATA[Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向.

比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道具可以帮助他寻找这样的路线,而那个魔法道]]></description><category></category></item><item><title><![CDATA[A - Kill the monster （DFS）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54234680</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54234680</guid><author>acmtl</author><pubDate>Sun, 08 Jan 2017 16:42:41 +0800</pubDate><description><![CDATA[水题


There is a mountain near yifenfei’s hometown. On the mountain lived a big monster. As a hero in hometown, yifenfei wants to kill it.

Now we know yifenfei have n spells, and the monster have]]></description><category></category></item><item><title><![CDATA[F - Nightmare （bfs+优先队列）]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54234657</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54234657</guid><author>acmtl</author><pubDate>Sun, 08 Jan 2017 16:40:57 +0800</pubDate><description><![CDATA[Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial ]]></description><category></category></item><item><title><![CDATA[C - Fire Net]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54234617</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54234617</guid><author>acmtl</author><pubDate>Sun, 08 Jan 2017 16:36:07 +0800</pubDate><description><![CDATA[Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.


A blockhouse is a small castl]]></description><category></category></item><item><title><![CDATA[E - Knight Moves]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54234603</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54234603</guid><author>acmtl</author><pubDate>Sun, 08 Jan 2017 16:34:07 +0800</pubDate><description><![CDATA[A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboa]]></description><category></category></item><item><title><![CDATA[O - Catch That Cow]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54173257</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54173257</guid><author>acmtl</author><pubDate>Sat, 07 Jan 2017 14:10:39 +0800</pubDate><description><![CDATA[Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point
N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point 
K (0 ≤ K ≤ 10]]></description><category></category></item><item><title><![CDATA[J - Dungeon Master]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54173241</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54173241</guid><author>acmtl</author><pubDate>Sat, 07 Jan 2017 14:09:26 +0800</pubDate><description><![CDATA[You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south]]></description><category></category></item><item><title><![CDATA[D - 胜利大逃亡]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54173190</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54173190</guid><author>acmtl</author><pubDate>Sat, 07 Jan 2017 14:05:51 +0800</pubDate><description><![CDATA[Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 

魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个.现在给你城堡的地图,请你计]]></description><category></category></item><item><title><![CDATA[I - Red and Black]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/54173178</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/54173178</guid><author>acmtl</author><pubDate>Sat, 07 Jan 2017 14:04:26 +0800</pubDate><description><![CDATA[There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can']]></description><category></category></item><item><title><![CDATA[A - 棋盘问题]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53842735</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53842735</guid><author>acmtl</author><pubDate>Fri, 23 Dec 2016 18:42:18 +0800</pubDate><description><![CDATA[在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。
Input
输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n 
当为-1 -1时表示输入结束。 ]]></description><category></category></item><item><title><![CDATA[K - 迷宫问题]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53842721</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53842721</guid><author>acmtl</author><pubDate>Fri, 23 Dec 2016 18:38:52 +0800</pubDate><description><![CDATA[定义一个二维数组： 
int maze[5][5] = {

	0, 1, 0, 0, 0,

	0, 1, 0, 1, 0,

	0, 0, 0, 0, 0,

	0, 1, 1, 1, 0,

	0, 0, 0, 1, 0,

};

它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。 Input
一个5 × ]]></description><category></category></item><item><title><![CDATA[B. 组合数]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53790097</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53790097</guid><author>acmtl</author><pubDate>Wed, 21 Dec 2016 19:19:48 +0800</pubDate><description><![CDATA[B. 组合数

Time Limit: 3000ms
Memory Limit: 128000KB
64-bit integer IO format:      Java class name:

SubmitStatus

PID: 4644 

找出从自然数1、2、... 、n（0<n<10）中任取r(0<r<=n)个数的所有组合。


Input 
输入n、r。]]></description><category></category></item><item><title><![CDATA[C. 部分和问题]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53672668</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53672668</guid><author>acmtl</author><pubDate>Thu, 15 Dec 2016 17:00:43 +0800</pubDate><description><![CDATA[给定整数a1、a2、.......an，判断是否可以从中选出若干数，使它们的和恰好为K。

Input 
首先，n和k，n表示数的个数，k表示数的和。
接着一行n个数。
（1<=n<=20,保证不超int范围）


Output 
如果和恰好可以为k，输出“YES”，并按输入顺序依次输出是由哪几个数的和组成，否则“NO”


Sample Input 
4 13
1 2 ]]></description><category></category></item><item><title><![CDATA[D. zb的生日]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53612518</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53612518</guid><author>acmtl</author><pubDate>Tue, 13 Dec 2016 19:16:43 +0800</pubDate><description><![CDATA[今天是阴历七月初五，acm队员zb的生日。zb正在和C小加、never在武汉集训。他想给这两位兄弟买点什么庆祝生日，经过调查，zb发现C小加和never都很喜欢吃西瓜，而且一吃就是一堆的那种，zb立刻下定决心买了一堆西瓜。当他准备把西瓜送给C小加和never的时候，遇到了一个难题，never和C小加不在一块住，只能把西瓜分成两堆给他们，为了对每个人都公平，他想让两堆的重量之差最小。每个西瓜的重量已]]></description><category></category></item><item><title><![CDATA[O. Saving HDU]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53580554</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53580554</guid><author>acmtl</author><pubDate>Mon, 12 Dec 2016 11:03:44 +0800</pubDate><description><![CDATA[话说上回讲到海东集团面临内外交困，公司的元老也只剩下XHD夫妇二人了。显然，作为多年拼搏的商人，XHD不会坐以待毙的。
  一天，当他正在苦思冥想解困良策的时候，突然想到了自己的传家宝，那是公司成立的时候，父亲作为贺礼送来的一个锦囊，徐父当时交代，不到万不得已的时候，不要打开它。“现在不正是最需要的时候吗？”，一边想，XHD一边找到了这个精心保管的锦囊，打开一看，里面只有一句话“杭城北麓千人洞有]]></description><category></category></item><item><title><![CDATA[A. 最少步数]]></title><link>https://blog.youkuaiyun.com/acmtl/article/details/53580273</link><guid>https://blog.youkuaiyun.com/acmtl/article/details/53580273</guid><author>acmtl</author><pubDate>Mon, 12 Dec 2016 10:42:40 +0800</pubDate><description><![CDATA[这有一个迷宫，有0~8行和0~8列：
 1,1,1,1,1,1,1,1,1
 1,0,0,1,0,0,1,0,1
 1,0,0,1,1,0,0,0,1
 1,0,1,0,1,1,0,1,1
 1,0,0,0,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,0,0,0,1
 1,1,1,1,1,1,1,1,1
]]></description><category></category></item></channel></rss>