<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Grant Yuan的专栏]]></title><description><![CDATA[欢迎访问我的新blog:http://www.cnblogs.com/codeyuan/]]></description><link>https://blog.youkuaiyun.com/Yuanchang_Best</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Yuanchang_Best]]></copyright><item><title><![CDATA[HDU 1162 Prim]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43163717</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43163717</guid><author>Yuanchang_Best</author><pubDate>Mon, 26 Jan 2015 21:55:29 +0800</pubDate><description><![CDATA[Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7287 Accepted Submission(s): 3689


Problem Description
Eddy begins to like p]]></description><category></category></item><item><title><![CDATA[HDU 1142]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43156625</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43156625</guid><author>Yuanchang_Best</author><pubDate>Mon, 26 Jan 2015 19:24:36 +0800</pubDate><description><![CDATA[A Walk Through the Forest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5999 Accepted Submission(s): 2215


Problem Description
Jimmy expe]]></description><category></category></item><item><title><![CDATA[POJ 2240 Bellman_Ford]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43153643</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43153643</guid><author>Yuanchang_Best</author><pubDate>Mon, 26 Jan 2015 16:11:06 +0800</pubDate><description><![CDATA[Arbitrage
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 16429 Accepted: 6909

Description
Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a ]]></description><category></category></item><item><title><![CDATA[POJ 1125 Floyd]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43148865</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43148865</guid><author>Yuanchang_Best</author><pubDate>Mon, 26 Jan 2015 09:43:07 +0800</pubDate><description><![CDATA[Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 27978 Accepted: 15528

Description
Stockbrokers are known to overreact to rumours. You have been contracted to dev]]></description><category></category></item><item><title><![CDATA[POJ 2253 Dijkstra]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43121961</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43121961</guid><author>Yuanchang_Best</author><pubDate>Sun, 25 Jan 2015 22:08:39 +0800</pubDate><description><![CDATA[Frogger
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 27128 Accepted: 8824

Description
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who ]]></description><category></category></item><item><title><![CDATA[POJ 3259 Bellman_Ford]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43117407</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43117407</guid><author>Yuanchang_Best</author><pubDate>Sun, 25 Jan 2015 19:45:54 +0800</pubDate><description><![CDATA[Wormholes
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 32474 Accepted: 11808

Description

While exploring his many farms, Farmer John has discovered a number of amazing wormholes.]]></description><category></category></item><item><title><![CDATA[POJ 1860 Bellman_Ford]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43116359</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43116359</guid><author>Yuanchang_Best</author><pubDate>Sun, 25 Jan 2015 18:42:06 +0800</pubDate><description><![CDATA[Currency Exchange
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 21092 Accepted: 7554

Description
Several currency exchange points are working in our city. Let us suppose that each p]]></description><category></category></item><item><title><![CDATA[浙大计算机研究生复试上机考试-2010年   最短路径问题]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43056177</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43056177</guid><author>Yuanchang_Best</author><pubDate>Fri, 23 Jan 2015 15:10:03 +0800</pubDate><description><![CDATA[最短路径问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14405 Accepted Submission(s): 4408


Problem Description
给你n个点，m条无向边，每条边都有长度d和花费p，给你起]]></description><category></category></item><item><title><![CDATA[浙大计算机研究生复试上机考试-2010年 zoj问题]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43015699</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/43015699</guid><author>Yuanchang_Best</author><pubDate>Thu, 22 Jan 2015 10:12:14 +0800</pubDate><description><![CDATA[ZOJ问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2984 Accepted Submission(s): 906


Problem Description
对给定的字符串(只包含'z','o','j'三种字符),判断他]]></description><category></category></item><item><title><![CDATA[浙大计算机研究生复试上机考试-2010年]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/42980917</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/42980917</guid><author>Yuanchang_Best</author><pubDate>Wed, 21 Jan 2015 21:59:11 +0800</pubDate><description><![CDATA[二叉搜索树
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3007 Accepted Submission(s): 1310


Problem Description
判断两序列是否为同一二叉搜索树序列


Input
]]></description><category></category></item><item><title><![CDATA[HDU 1885 BFS+状态压缩]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41541603</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41541603</guid><author>Yuanchang_Best</author><pubDate>Thu, 27 Nov 2014 09:21:19 +0800</pubDate><description><![CDATA[Key Task
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1239    Accepted Submission(s): 495


Problem Description
The Czech Technical Un]]></description><category></category></item><item><title><![CDATA[HDU 1429 BFS+状态压缩]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41522011</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41522011</guid><author>Yuanchang_Best</author><pubDate>Wed, 26 Nov 2014 20:55:17 +0800</pubDate><description><![CDATA[胜利大逃亡(续)
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5461 Accepted Submission(s): 1878


Problem Description
Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王]]></description><category></category></item><item><title><![CDATA[HDU 1195]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41513309</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41513309</guid><author>Yuanchang_Best</author><pubDate>Wed, 26 Nov 2014 11:19:20 +0800</pubDate><description><![CDATA[HDU 1195
双端BFS
/*************************************************************************
	> File Name: 2.cpp
	> Author:yuan
	> Mail:
	> Created Time: 2014年11月25日 星期二 23时33分09秒
*********************]]></description><category></category></item><item><title><![CDATA[HDU 1175]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41492035</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/41492035</guid><author>Yuanchang_Best</author><pubDate>Tue, 25 Nov 2014 21:53:01 +0800</pubDate><description><![CDATA[HDU 1175
简单 BFS


/*************************************************************************
	> File Name: 1.cpp
	> Author:yuan 
	> Mail: 
	> Created Time: 2014年11月25日 星期二 19时40分03秒
 *************]]></description><category></category></item><item><title><![CDATA[第一轮 D]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991347</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991347</guid><author>Yuanchang_Best</author><pubDate>Mon, 10 Nov 2014 23:22:42 +0800</pubDate><description><![CDATA[Virus
Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status

Description
Download as PDF

Virus 

We have a log file, which is a sequence of recorded events. Naturally,]]></description><category></category></item><item><title><![CDATA[第一轮 J]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991307</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991307</guid><author>Yuanchang_Best</author><pubDate>Mon, 10 Nov 2014 23:21:12 +0800</pubDate><description><![CDATA[MetroTime Limit:500MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64uSubmitStatusDescription Many of SKB Kontur programmers like to get to work by Metro because the main office is situated qu]]></description><category></category></item><item><title><![CDATA[第一轮 M]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991261</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40991261</guid><author>Yuanchang_Best</author><pubDate>Mon, 10 Nov 2014 23:18:51 +0800</pubDate><description><![CDATA[Milliard Vasya's Function
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit Status

Description
Vasya is the beginning mathematician. He decided to make an impor]]></description><category></category></item><item><title><![CDATA[第一轮 L]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40961229</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40961229</guid><author>Yuanchang_Best</author><pubDate>Sun, 09 Nov 2014 23:40:46 +0800</pubDate><description><![CDATA[Scientific Conference
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit Status

Description
Functioning of a scientific conference is usually divided into severa]]></description><category></category></item><item><title><![CDATA[第一轮 K]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40958907</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40958907</guid><author>Yuanchang_Best</author><pubDate>Sun, 09 Nov 2014 23:04:23 +0800</pubDate><description><![CDATA[Maximum Sum
Time Limit:500MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit Status

Description
Given a 2-dimensional array of positive and negative integers, find the sub-rect]]></description><category></category></item><item><title><![CDATA[第一轮 I]]></title><link>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40957053</link><guid>https://blog.youkuaiyun.com/Yuanchang_Best/article/details/40957053</guid><author>Yuanchang_Best</author><pubDate>Sun, 09 Nov 2014 22:16:17 +0800</pubDate><description><![CDATA[K-based Numbers
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit Status

Description
Let’s consider K-based numbers, containing exactly N digits. We define a nu]]></description><category></category></item></channel></rss>