<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SBS的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/SBS2000</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SBS2000]]></copyright><item><title><![CDATA[[置顶]待簳的题......]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757026</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757026</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:34 +0800</pubDate><description><![CDATA[贪心：
bzoj1972 [Sdoi2010]猪国杀
DP：
HDU 4901
POJ 1015
TYVJ 1864
TYVJ 1933
TYVJ 2002
POJ 1737
CF 313 div.1 C
Nescafé2 月之谜
POJ 2288
TYVJ 1051
HDU bobo
IOI island
 
the romabtic hero          ]]></description><category></category></item><item><title><![CDATA[[置顶]记录脑残失误，让达摩克利斯之剑永远高悬]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757025</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757025</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:30 +0800</pubDate><description><![CDATA[这里记录自己在编程中犯下的错误
“我不怕犯错误，怕的是犯后再犯。”——S.B.S.
记录如下：
 

1、在开了一个全局变量后，在主函数中又开了一个同名变量。
2、写着写着就把变量名改了……     （e.g.起初是ne[][]，写到一半就变成了next[][]）
3、开的是一维数组，主程序中写的是二维。
4、在变量初始化时错误，改了一个钟头。
5、写区间DP时将几个循环顺序弄错]]></description><category></category></item><item><title><![CDATA[poj 2240 Arbitrage 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757024</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757024</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:24 +0800</pubDate><description><![CDATA[Arbitrage




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 21300
 
Accepted: 9079




Description
Arbitrage is the use of discrepancies in currency exchange rates t]]></description><category></category></item><item><title><![CDATA[洛谷 p1352 没有上司的舞会 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757022</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757022</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:19 +0800</pubDate><description><![CDATA[P1352 没有上司的舞会
题目描述
某大学有N个职员，编号为1~N。他们之间有从属关系，也就是说他们的关系就像一棵以校长为根的树，父结点就是子结点的直接上司。现在有个周年庆宴会，宴会每邀请来一个职员都会增加一定的快乐指数Ri，但是呢，如果某个职员的上司来参加舞会了，那么这个职员就无论如何也不肯来参加舞会了。所以，请你编程计算，邀请哪些职员可以使快乐指数最大，求最大的快乐指数。
输入输出格式]]></description><category></category></item><item><title><![CDATA[BZOJ 1093 最大半连通子图 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757020</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757020</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:13 +0800</pubDate><description><![CDATA[1093: [ZJOI2007]最大半连通子图
Time Limit: 30 Sec  Memory Limit: 162 MBSubmit: 2767  Solved: 1095[Submit][Status][Discuss]
Description

　　一个有向图G=(V,E)称为半连通的(Semi-Connected)，如果满足：?u,v∈V，满足u→v或v→u，即对于图中任意两]]></description><category></category></item><item><title><![CDATA[poj 1325 Machine Schedule 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757018</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757018</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:09 +0800</pubDate><description><![CDATA[Machine Schedule




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 14479
 
Accepted: 6172




Description
As we all know, machine scheduling is a very classical prob]]></description><category></category></item><item><title><![CDATA[poj 1469 COURSES 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757017</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757017</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:05 +0800</pubDate><description><![CDATA[COURSES




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 21515
 
Accepted: 8455




Description
Consider a group of N students and P courses. Each student visits ze]]></description><category></category></item><item><title><![CDATA[poj 3041 Asteroids 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757016</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757016</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:27:01 +0800</pubDate><description><![CDATA[Asteroids




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 20686
 
Accepted: 11239




Description
Bessie wants to navigate her spaceship through a dangerous astero]]></description><category></category></item><item><title><![CDATA[vijos p1729 Knights]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757014</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757014</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:57 +0800</pubDate><description><![CDATA[描述

在一个N*N的正方形棋盘上，放置了一些骑士。我们将棋盘的行用1开始的N个自然数标记，将列用'A'开始的N个大写英文字母标记。举个例子来说，一个标准的8*8的国际象棋棋盘的行标记为1..8，列标记为A..H，D3、H1分别表示棋盘上第3行第4列和第1行第8列的格子。
骑士是这样一类棋子。若一个骑士放置在格子(x, y)。那么格子(x-2, y-1), (x-2, y+1), (x-1,]]></description><category></category></item><item><title><![CDATA[bzoj 1975 [Sdoi2010]魔法猪学院]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757010</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757010</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:51 +0800</pubDate><description><![CDATA[1975: [Sdoi2010]魔法猪学院
Time Limit: 10 Sec  Memory Limit: 64 MBSubmit: 1758  Solved: 557[Submit][Status][Discuss]
Description
iPig在假期来到了传说中的魔法猪学院，开始为期两个月的魔法猪训练。经过了一周理论知识和一周基本魔法的学习之后，iPig对猪世界的世界本原有了很多]]></description><category></category></item><item><title><![CDATA[洛谷P1772 [ZJOI2006]物流运输 题解]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757008</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757008</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:47 +0800</pubDate><description><![CDATA[题目描述
物流公司要把一批货物从码头A运到码头B。由于货物量比较大，需要n天才能运完。货物运输过程中一般要转停好几个码头。物流公司通常会设计一条固定的运输路线，以便对整个运输过程实施严格的管理和跟踪。由于各种因素的存在，有的时候某个码头会无法装卸货物。这时候就必须修改运输路线，让货物能够按时到达目的地。但是修改路线是—件十分麻烦的事情，会带来额外的成本。因此物流公司希望能够订一个n天的运输计划，]]></description><category></category></item><item><title><![CDATA[学习笔记：斐波那契堆]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757004</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757004</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:41 +0800</pubDate><description><![CDATA[先人竟留下如此神奇之物。。。。。。
引言：    来考虑一个问题，平面上6个点，A,B,C,D,E,F，假定已知其中一些点之间的距离，现在，要求A到其它5个点，B,C,D,E,F各点的最短距离。
如下图所示：
      
经过上图，我们可以轻而易举的得到A->B,C,D,E,F各点的最短距离：
目的            路径              最短距离A=>A，      A]]></description><category></category></item><item><title><![CDATA[蛇梯棋（转载）]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52757001</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52757001</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:37 +0800</pubDate><description><![CDATA[1 //题目的大概意思是又N*N的棋盘，编号从1 到 N*N 棋盘中分布着蛇和梯子玩家在位置1处，
 2 //然后掷骰子，如果点数在梯子尾则顺着梯子到达梯子头，若掷到蛇头，则滑到蛇尾
 3 //问最快到达终点所需掷的次数...
 4 // 输入描述： 1表示1组数据，6 1 3分别表示棋盘大小，蛇的个数和梯子的个数
 5 //35 25 表示蛇的头和尾巴     最后一行表示各个梯子的头和]]></description><category></category></item><item><title><![CDATA[POJ 1270 Following Orders]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756998</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756998</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:31 +0800</pubDate><description><![CDATA[Following Orders




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 4902
 
Accepted: 1982




Description
Order is an important concept in mathematics and in computer]]></description><category></category></item><item><title><![CDATA[学习笔记：欧拉函数]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756995</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756995</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:25 +0800</pubDate><description><![CDATA[欧拉函数是指：对于一个正整数n，小于n且和n互质的正整数（包括1）的个数，记作φ(n) 。
 
通式：φ(x)=x*(1-1/p1)*(1-1/p2)*(1-1/p3)*(1-1/p4)…..(1-1/pn),其中p1, p2……pn为x的所有质因数，x是不为0的整数。φ(1)=1（唯一和1互质的数就是1本身）。
对于质数p，φ(p) = p - 1。注意φ(1)=1.
欧拉定理：对于互质]]></description><category></category></item><item><title><![CDATA[bzoj 1565 [NOI2009]植物大战僵尸 解题报告]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756990</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756990</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:15 +0800</pubDate><description><![CDATA[1565: [NOI2009]植物大战僵尸
Time Limit: 10 Sec  Memory Limit: 64 MBSubmit: 2161  Solved: 1000[Submit][Status][Discuss]
Description

Input

Output
仅包含一个整数，表示可以获得的最大能源收入。注意，你也可以选择不进行任何攻击，这样能源收入为0。
Sam]]></description><category></category></item><item><title><![CDATA[poj 1861 Network 解题报告]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756987</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756987</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:08 +0800</pubDate><description><![CDATA[Network




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 16171
 
Accepted: 6417
 
Special Judge




Description
Andrew is working as system administrator and is p]]></description><category></category></item><item><title><![CDATA[poj 2585 Window Pains 解题报告]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756984</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756984</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:26:04 +0800</pubDate><description><![CDATA[Window Pains




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 2027
 
Accepted: 1025




Description
Boudreaux likes to multitask, especially when it comes to using ]]></description><category></category></item><item><title><![CDATA[poj 2284 That Nice Euler Circuit 解题报告]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756981</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756981</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:25:59 +0800</pubDate><description><![CDATA[That Nice Euler Circuit




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 1975
 
Accepted: 624




Description
Little Joey invented a scrabble machine that he called]]></description><category></category></item><item><title><![CDATA[bzoj 3670 [NOI2014]动物园]]></title><link>https://blog.youkuaiyun.com/SBS2000/article/details/52756980</link><guid>https://blog.youkuaiyun.com/SBS2000/article/details/52756980</guid><author>SBS2000</author><pubDate>Sun, 18 Sep 2016 15:25:53 +0800</pubDate><description><![CDATA[3670: [Noi2014]动物园
Time Limit: 10 Sec  Memory Limit: 512 MBSubmit: 2032  Solved: 1077[Submit][Status][Discuss]
Description

近日，园长发现动物园中好吃懒做的动物越来越多了。例如企鹅，只会卖萌向游客要吃的。为了整治动物园的不良风气，让动物们凭自己的真才实学向游客要吃的，]]></description><category></category></item></channel></rss>