<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[=_=]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/x806073382</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; x806073382]]></copyright><item><title><![CDATA[斯特林近似]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/54799788</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/54799788</guid><author>x806073382</author><pubDate>Tue, 31 Jan 2017 18:00:01 +0800</pubDate><description><![CDATA[斯特林公式是用来求大数阶乘的公式π＝acos(-1)e = 2.718281828459]]></description><category></category></item><item><title><![CDATA[POJ-3268 Silver Cow Party  (Dijkstra求有向图最短路)]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53467265</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53467265</guid><author>x806073382</author><pubDate>Mon, 05 Dec 2016 17:15:53 +0800</pubDate><description><![CDATA[Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 19722        Accepted: 9022 
DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the bi]]></description><category></category></item><item><title><![CDATA[Codeforces Beta Round #61 (Div. 2) B. Petya and Countryside    (DP)]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53466163</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53466163</guid><author>x806073382</author><pubDate>Mon, 05 Dec 2016 15:54:14 +0800</pubDate><description><![CDATA[time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Little Petya often travels to his grandmother in the countryside. The grandmother has a lar]]></description><category></category></item><item><title><![CDATA[HDU-5744 Keep On Movin（回文串 贪心）]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53380952</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53380952</guid><author>x806073382</author><pubDate>Mon, 28 Nov 2016 17:30:21 +0800</pubDate><description><![CDATA[Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 
Total Submission(s): 1030    Accepted Submission(s): 725Problem Description 
Professor Zhang has kinds of characters]]></description><category></category></item><item><title><![CDATA[HDU-2544 最短路（Dijkstra算法求无向图最短路模板题）]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53380130</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53380130</guid><author>x806073382</author><pubDate>Mon, 28 Nov 2016 16:51:05 +0800</pubDate><description><![CDATA[最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 57379    Accepted Submission(s): 25280Problem Description 
在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shir]]></description><category></category></item><item><title><![CDATA[Codeforces Round #209 (Div. 2) B. Alyona and flowers]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53378714</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53378714</guid><author>x806073382</author><pubDate>Mon, 28 Nov 2016 15:46:08 +0800</pubDate><description><![CDATA[B. Permutation 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
A permutation p is an ordered group of numbers p1,   p2,   …,   pn, consisti]]></description><category></category></item><item><title><![CDATA[Codeforces Round #209 (Div. 2) A.Table]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53378525</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53378525</guid><author>x806073382</author><pubDate>Mon, 28 Nov 2016 15:34:51 +0800</pubDate><description><![CDATA[time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Simon has a rectangular table consisting of n rows and m columns. Simon numbered the rows of]]></description><category></category></item><item><title><![CDATA[Codeforces Round #381 (Div. 2) A.Alyona and copybooks]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53323023</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53323023</guid><author>x806073382</author><pubDate>Thu, 24 Nov 2016 17:47:58 +0800</pubDate><description><![CDATA[time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so]]></description><category></category></item><item><title><![CDATA[链式前向星存储实现BFS]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53322148</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53322148</guid><author>x806073382</author><pubDate>Thu, 24 Nov 2016 16:45:44 +0800</pubDate><description><![CDATA[代码：/*************************************************************************
    > File Name: store.cpp
    > Author: SIU
    > Created Time: 2016年11月24日 星期四 13时34分39秒
 *******************************]]></description><category></category></item><item><title><![CDATA[深度理解链式前向星]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53321838</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53321838</guid><author>x806073382</author><pubDate>Thu, 24 Nov 2016 16:27:21 +0800</pubDate><description><![CDATA[深度理解链式前向星            
        
    
    <div class="article_manage clearfix">
    <div class="article_r">
        <span class="link_postdate">2013-11-23 16:55</span>
        <span class="link_view" tit]]></description><category></category></item><item><title><![CDATA[HDU 5500 Reorder the Books （规律）]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53296613</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53296613</guid><author>x806073382</author><pubDate>Wed, 23 Nov 2016 00:22:49 +0800</pubDate><description><![CDATA[Reorder the BooksTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) 
Total Submission(s): 1416    Accepted Submission(s): 742Problem Description 
dxy has a collection]]></description><category></category></item><item><title><![CDATA[最长递增子序列  动态规划基础]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53262953</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53262953</guid><author>x806073382</author><pubDate>Mon, 21 Nov 2016 19:40:48 +0800</pubDate><description><![CDATA[1134 最长递增子序列 
基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题 收藏  关注 
给出长度为N的数组，找出这个数组的最长递增子序列。(递增子序列是指，子序列的元素是递增的） 
例如：5 1 6 8 2 4 5 10，最长递增子序列是1 2 4 5 10。 
Input 
第1行：1个数N，N为序列的长度(2 <= N <= 50000) 
第2 - N + 1]]></description><category></category></item><item><title><![CDATA[UVA 11624 Fire]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53192055</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53192055</guid><author>x806073382</author><pubDate>Wed, 16 Nov 2016 21:22:28 +0800</pubDate><description><![CDATA[Joe works in a maze. Unfortunately, portions of the maze have 
caught on fire, and the owner of the maze neglected to create a fire 
escape plan. Help Joe escape the maze. 
Given Joe’s location in the]]></description><category></category></item><item><title><![CDATA[HDU 1495 非常可乐]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53191898</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53191898</guid><author>x806073382</author><pubDate>Wed, 16 Nov 2016 21:05:31 +0800</pubDate><description><![CDATA[非常可乐Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 11756    Accepted Submission(s): 4738Problem Description 
大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不]]></description><category></category></item><item><title><![CDATA[HDU 1010 Tempter of the Bone（奇偶剪枝）]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53191836</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53191836</guid><author>x806073382</author><pubDate>Wed, 16 Nov 2016 20:56:25 +0800</pubDate><description><![CDATA[Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 111149    Accepted Submission(s): 30144Problem Description 
The doggie found]]></description><category></category></item><item><title><![CDATA[POJ 2676 Sudoku]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53189274</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53189274</guid><author>x806073382</author><pubDate>Wed, 16 Nov 2016 17:50:35 +0800</pubDate><description><![CDATA[Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 18838        Accepted: 9078      Special Judge 
DescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is div]]></description><category></category></item><item><title><![CDATA[ACM题集以及各种总结大全]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/53000470</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/53000470</guid><author>x806073382</author><pubDate>Tue, 01 Nov 2016 20:50:37 +0800</pubDate><description><![CDATA[ACM题集以及各种总结大全！        虽然退役了，但是整理一下，供小弟小妹们以后切题方便一些，但由于近来考试太多，顾退役总结延迟一段时间再写！先写一下各种分类和题集，欢迎各位大牛路过指正。        一.ACM入门        关于ACM    百度百科连接        杭州电子科技大学(hdu)ACM题目    连接        关于acm的帮助     连接        北京大]]></description><category></category></item><item><title><![CDATA[CF #222 div1 A Maze]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/52891820</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/52891820</guid><author>x806073382</author><pubDate>Sat, 22 Oct 2016 13:32:15 +0800</pubDate><description><![CDATA[A. Maze 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is]]></description><category></category></item><item><title><![CDATA[CF #377div2C Sanatorium]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/52847844</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/52847844</guid><author>x806073382</author><pubDate>Tue, 18 Oct 2016 12:27:39 +0800</pubDate><description><![CDATA[C. Sanatorium 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Vasiliy spent his vacation in a sanatorium, came back and found that he compl]]></description><category></category></item><item><title><![CDATA[HDU 1016 Prime Ring Problem]]></title><link>https://blog.youkuaiyun.com/x806073382/article/details/52840922</link><guid>https://blog.youkuaiyun.com/x806073382/article/details/52840922</guid><author>x806073382</author><pubDate>Mon, 17 Oct 2016 18:58:13 +0800</pubDate><description><![CDATA[Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 43965    Accepted Submission(s): 19481Problem Description 
A ring is compose]]></description><category></category></item></channel></rss>