<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[silver_bone的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/silver_bone</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; silver_bone]]></copyright><item><title><![CDATA[51nod 0和1相等串]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78776268</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78776268</guid><author>silver_bone</author><pubDate>Mon, 11 Dec 2017 20:18:13 +0800</pubDate><description><![CDATA[题目链接：https://www.51nod.com/onlineJudge/submitDetail.html#!judgeId=424616题解：很好的一道思维题，自己一开始的想法就是dp，但是范围比较大，也没什么好的想法。后来又想用二分，但没什么用（范围还是太大），最后看到了大佬的思路，因为数的种类比较少，直接进行＋和－的操作就能纪录所有的状态，学到了。代码：#include <cmath>]]></description><category></category></item><item><title><![CDATA[51nod 1051 最大子矩阵和]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78608502</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78608502</guid><author>silver_bone</author><pubDate>Wed, 22 Nov 2017 21:19:47 +0800</pubDate><description><![CDATA[题目链接： 
https://www.51nod.com/onlineJudge/submitDetail.html#!judgeId=407086 
题解： 
最大字段和的变形 
代码：#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <iostrea]]></description><category></category></item><item><title><![CDATA[hdu A Simple Stone Game]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78508582</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78508582</guid><author>silver_bone</author><pubDate>Sat, 11 Nov 2017 20:51:11 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6237题解：stm看的时候没看到每次只能取一个，蛇皮了半天。唉。。。。。。 
直接暴力枚举质因子就行了。代码：#include <map>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <i]]></description><category></category></item><item><title><![CDATA[51nod 1006 最长公共子序列Lcs]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78504797</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78504797</guid><author>silver_bone</author><pubDate>Sat, 11 Nov 2017 09:48:01 +0800</pubDate><description><![CDATA[题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1006题解：重新刷一下51,发现自己连这基础题都打了半天，唉，不行了。代码：#include <set>
#include <map>
#include <cmath>
#include <string>
#include <vector>
#include <cs]]></description><category></category></item><item><title><![CDATA[codeforces 887B]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78494470</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78494470</guid><author>silver_bone</author><pubDate>Thu, 09 Nov 2017 21:48:30 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/contest/887/problem/B题解：100％纯暴力代码：#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namesp]]></description><category></category></item><item><title><![CDATA[bzoj 1012]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78492969</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78492969</guid><author>silver_bone</author><pubDate>Thu, 09 Nov 2017 19:18:46 +0800</pubDate><description><![CDATA[题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1012题解：很久没怎么写线段树了，一个小错误错了半天。唉！代码：#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;]]></description><category></category></item><item><title><![CDATA[code forces E. Danil and a Part-time Job]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78483165</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78483165</guid><author>silver_bone</author><pubDate>Wed, 08 Nov 2017 20:56:20 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/contest/877/problem/E题解：dfs序+线段树区间更新和区间求和代码：#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace s]]></description><category></category></item><item><title><![CDATA[codeforces 877D]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78472379</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78472379</guid><author>silver_bone</author><pubDate>Tue, 07 Nov 2017 20:51:51 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/contest/877/problem/D题解：有段时间没怎么好好打代码了，简单的BFS打错了一个地方，找了半天。代码：#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <]]></description><category></category></item><item><title><![CDATA[codeforces 877C]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78471541</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78471541</guid><author>silver_bone</author><pubDate>Tue, 07 Nov 2017 19:40:04 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/contest/877/problem/C题解：规律题。代码：#include <map>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorith]]></description><category></category></item><item><title><![CDATA[codeforces 877B]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78471170</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78471170</guid><author>silver_bone</author><pubDate>Tue, 07 Nov 2017 19:05:47 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/contest/877/problem/B题解：暴力区间更新代码：#include <map>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespa]]></description><category></category></item><item><title><![CDATA[Gym - 100851F Froggy Ford]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78430100</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78430100</guid><author>silver_bone</author><pubDate>Thu, 02 Nov 2017 22:19:55 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/gym/100851/attachments题解：二分枚举长度，BFS暴力找路径，注意边界的处理代码：#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#incl]]></description><category></category></item><item><title><![CDATA[codeforces 873B]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78396994</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78396994</guid><author>silver_bone</author><pubDate>Mon, 30 Oct 2017 20:29:46 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/873/B题解：前缀和＋离散化，dp的暴力更新。代码：#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,s]]></description><category></category></item><item><title><![CDATA[2015 ACM National Contest Romania - Round 1 B]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78306141</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78306141</guid><author>silver_bone</author><pubDate>Sat, 21 Oct 2017 20:32:16 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/gym/100923/problem/B题解：Dijkstra＋优化，用Spfa会炸代码：#include<map>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
using na]]></description><category></category></item><item><title><![CDATA[Gym - 101473J]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78301866</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78301866</guid><author>silver_bone</author><pubDate>Sat, 21 Oct 2017 10:42:21 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/gym/101473/attachments题解：最大生成树＋树链剖分＋线段树维护最小值代码：#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>]]></description><category></category></item><item><title><![CDATA[Bzoj 1036: [ZJOI2008]树的统计Count]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78289653</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78289653</guid><author>silver_bone</author><pubDate>Thu, 19 Oct 2017 21:24:14 +0800</pubDate><description><![CDATA[题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1036题解：树链剖分＋线段树操作代码：#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(]]></description><category></category></item><item><title><![CDATA[hdu 6006 Engineer Assignment]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78219429</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78219429</guid><author>silver_bone</author><pubDate>Thu, 12 Oct 2017 20:34:24 +0800</pubDate><description><![CDATA[题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=6006题解：状态压缩＋类背包dp代码：#include <cmath>
#include <vector>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm]]></description><category></category></item><item><title><![CDATA[51nod 1127 最短的包含字符串]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78178023</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78178023</guid><author>silver_bone</author><pubDate>Sun, 08 Oct 2017 22:11:19 +0800</pubDate><description><![CDATA[题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1127题解：尺取。自己用的deque（尺取和滑动窗口都能用）代码：#include <map>
#include <cmath>
#include <vector>
#include <queue>
#include <cstdio>
#include <cstri]]></description><category></category></item><item><title><![CDATA[51nod 1596 搬货物]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78177492</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78177492</guid><author>silver_bone</author><pubDate>Sun, 08 Oct 2017 21:03:21 +0800</pubDate><description><![CDATA[题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596题解：论外挂的重要性，强行卡过去。代码：#include <map>
#include <cmath>
#include <vector>
#include <queue>
#include <cstdio>
#include <cstring>
#inclu]]></description><category></category></item><item><title><![CDATA[hdu 3689 Infinite monkey theorem]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78173560</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78173560</guid><author>silver_bone</author><pubDate>Sun, 08 Oct 2017 10:39:20 +0800</pubDate><description><![CDATA[题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=3689题解：kmp+概率dp代码：#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,]]></description><category></category></item><item><title><![CDATA[codeforces 869A The Artful Expedient]]></title><link>https://blog.youkuaiyun.com/silver_bone/article/details/78171367</link><guid>https://blog.youkuaiyun.com/silver_bone/article/details/78171367</guid><author>silver_bone</author><pubDate>Sat, 07 Oct 2017 20:24:17 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/869/A题解：直接map，炸了时间。以后还是老老实实写个find的函数。 
心碎。代码：#include <map>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#in]]></description><category></category></item></channel></rss>