<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[In my way]]></title><description><![CDATA[小白一只 在通往大神的路上]]></description><link>https://blog.youkuaiyun.com/song_4</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; song_4]]></copyright><item><title><![CDATA[HDU 1856 More is better（并查集）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53419309</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53419309</guid><author>song_4</author><pubDate>Thu, 01 Dec 2016 11:02:22 +0800</pubDate><description><![CDATA[More is better
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 25387    Accepted Submission(s): 9107


Problem Description
Mr Wang want]]></description><category></category></item><item><title><![CDATA[HDU 5621 KK's Point（数学+规律题）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53419257</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53419257</guid><author>song_4</author><pubDate>Thu, 01 Dec 2016 10:55:24 +0800</pubDate><description><![CDATA[KK's Point
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1327    Accepted Submission(s): 439


Problem Description
Our lovely KK has a ]]></description><category></category></item><item><title><![CDATA[HDU 5387 Clock（模拟）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53419141</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53419141</guid><author>song_4</author><pubDate>Thu, 01 Dec 2016 10:44:23 +0800</pubDate><description><![CDATA[Clock
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1209    Accepted Submission(s): 685


Problem Description
Give a time.(hh:mm:ss)，yo]]></description><category></category></item><item><title><![CDATA[CODEVS 1169 传纸条(多线程DP)]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53404291</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53404291</guid><author>song_4</author><pubDate>Wed, 30 Nov 2016 09:27:19 +0800</pubDate><description><![CDATA[1169 传纸条
 

2008年NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 钻石 Diamond





题解













题目描述 Description

小渊和小轩是好朋友也是同班同学，他们在一起总有谈不完的话题。一次素质拓展活动中，班]]></description><category></category></item><item><title><![CDATA[CODEVS 1010 过河卒（棋盘型DP）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53404045</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53404045</guid><author>song_4</author><pubDate>Wed, 30 Nov 2016 09:04:12 +0800</pubDate><description><![CDATA[1010 过河卒
 

2002年NOIP全国联赛普及组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

　如图，A 点有一个过河卒，需要走到目标 B 点。卒行走规则：可以向下、或者向右。同时在]]></description><category></category></item><item><title><![CDATA[CODEVS 1018 单词接龙（DFS）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53398958</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53398958</guid><author>song_4</author><pubDate>Tue, 29 Nov 2016 20:09:21 +0800</pubDate><description><![CDATA[1018 单词接龙
 

2000年NOIP全国联赛普及组NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解


 查看运行结果











题目描述 Description

    单词接龙是一个与我们经常玩的成语接龙相]]></description><category></category></item><item><title><![CDATA[CODEVS 1098 均分纸牌（贪心）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53398589</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53398589</guid><author>song_4</author><pubDate>Tue, 29 Nov 2016 19:53:42 +0800</pubDate><description><![CDATA[1098 均分纸牌
 

2002年NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

有 N 堆纸牌，编号分别为 1，2，…, N。每堆上有若干张，但纸牌总数必为 N 的倍]]></description><category></category></item><item><title><![CDATA[CODEVS 1068 乌龟棋（背包型DP）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53382509</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53382509</guid><author>song_4</author><pubDate>Mon, 28 Nov 2016 19:19:40 +0800</pubDate><description><![CDATA[1068 乌龟棋
 

2010年NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 钻石 Diamond





题解













题目描述 Description

小明过生日的时候，爸爸送给他一副乌龟棋当作礼物。 乌龟棋的棋盘是一行N个格子，每个]]></description><category></category></item><item><title><![CDATA[CODEVS 1039 数的划分（划分型DP）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53376968</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53376968</guid><author>song_4</author><pubDate>Mon, 28 Nov 2016 14:17:09 +0800</pubDate><description><![CDATA[1039 数的划分
 

2001年NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

将整数n分成k份，且每份不能为空，任意两种划分方案不能相同(不考虑顺序)。
例如：n]]></description><category></category></item><item><title><![CDATA[CODEVS 1116 四色问题（DFS）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53373955</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53373955</guid><author>song_4</author><pubDate>Mon, 28 Nov 2016 09:37:15 +0800</pubDate><description><![CDATA[1116 四色问题






 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

给定N（小于等于8）个点的地图，以及地图上各点的相邻关系，请输出用4种颜色将地图涂色的所有方案数（要求相邻两点不能涂成相同的]]></description><category></category></item><item><title><![CDATA[CODEVS 1295 N皇后问题 (DFS）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53373722</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53373722</guid><author>song_4</author><pubDate>Mon, 28 Nov 2016 09:15:24 +0800</pubDate><description><![CDATA[1295 N皇后问题






 时间限制: 2 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

在n×n格的棋盘上放置彼此不受攻击的n个皇后。按照国际象棋的规则，皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。n]]></description><category></category></item><item><title><![CDATA[“玲珑杯”ACM比赛 Round #5 C -- Coco（递归）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53353943</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53353943</guid><author>song_4</author><pubDate>Sat, 26 Nov 2016 19:20:44 +0800</pubDate><description><![CDATA[C -- Coco


Time Limit：1s Memory Limit：64MByte

Submissions：262Solved：125




DESCRIPTION



Coco just learned a math operation call mod.Now,there is an integer 
aa
 and nn
 integers]]></description><category></category></item><item><title><![CDATA[“玲珑杯”ACM比赛 Round #5 H -- Variance（线段树+方差）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53352670</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53352670</guid><author>song_4</author><pubDate>Sat, 26 Nov 2016 19:07:45 +0800</pubDate><description><![CDATA[H -- Variance


Time Limit：1s Memory Limit：128MByte

Submissions：259Solved：80




DESCRIPTION



An array with length n is given.
You should support 2 types of operations.

1 x y chan]]></description><category></category></item><item><title><![CDATA[Code[VS] 1017 乘积最大 （划分型DP）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53322576</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53322576</guid><author>song_4</author><pubDate>Thu, 24 Nov 2016 17:12:15 +0800</pubDate><description><![CDATA[1017 乘积最大
 

2000年NOIP全国联赛普及组NOIP全国联赛提高组




 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解











题目描述 Description

今年是国际数学联盟确定的“2000——世界数学年”，又恰逢我国著名数学家]]></description><category></category></item><item><title><![CDATA[CODE[VS] 1048 石子归并（区间DP）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53322539</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53322539</guid><author>song_4</author><pubDate>Thu, 24 Nov 2016 17:10:28 +0800</pubDate><description><![CDATA[1048 石子归并






 时间限制: 1 s


 空间限制: 128000 KB


 题目等级 : 黄金 Gold





题解













题目描述 Description

有n堆石子排成一列，每堆石子有一个重量w[i], 每次合并可以合并相邻的两堆石子，一次合并的代价为两堆石子的重量和w[i]+]]></description><category></category></item><item><title><![CDATA[HDU 1325 Is It A Tree?（判断是否为树）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53261386</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53261386</guid><author>song_4</author><pubDate>Mon, 21 Nov 2016 17:15:51 +0800</pubDate><description><![CDATA[Is It A Tree?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 22511    Accepted Submission(s): 5117


Problem Description
A tree is a]]></description><category></category></item><item><title><![CDATA[HDU 1272 小希的迷宫 （并查集）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53261321</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53261321</guid><author>song_4</author><pubDate>Mon, 21 Nov 2016 17:12:07 +0800</pubDate><description><![CDATA[小希的迷宫

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 45367    Accepted Submission(s): 14100



Problem Description
上次Gardon的迷宫城堡小希玩]]></description><category></category></item><item><title><![CDATA[HDU 5092 Seam Carving （DP+打印路径）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53106041</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53106041</guid><author>song_4</author><pubDate>Wed, 09 Nov 2016 21:00:44 +0800</pubDate><description><![CDATA[Seam Carving

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1355    Accepted Submission(s): 534



Problem Description
Fish likes t]]></description><category></category></item><item><title><![CDATA[HDU 5584 LCM Walk （找规律+逆推）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53106012</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53106012</guid><author>song_4</author><pubDate>Wed, 09 Nov 2016 20:58:14 +0800</pubDate><description><![CDATA[LCM Walk

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1329    Accepted Submission(s): 684



Problem Description
A frog has just ]]></description><category></category></item><item><title><![CDATA[HDU 5093 Battle ships（二分图匹配）]]></title><link>https://blog.youkuaiyun.com/song_4/article/details/53102474</link><guid>https://blog.youkuaiyun.com/song_4/article/details/53102474</guid><author>song_4</author><pubDate>Wed, 09 Nov 2016 17:32:14 +0800</pubDate><description><![CDATA[Battle ships

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1238    Accepted Submission(s): 457



Problem Description
Dear contest]]></description><category></category></item></channel></rss>