<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SCUT_Pein]]></title><description><![CDATA[走好自己的路，勿迷失于他人风景、]]></description><link>https://blog.youkuaiyun.com/a305657</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a305657]]></copyright><item><title><![CDATA[3110: [Zjoi2013]K大数查询]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/48686589</link><guid>https://blog.youkuaiyun.com/a305657/article/details/48686589</guid><author>a305657</author><pubDate>Wed, 23 Sep 2015 20:24:49 +0800</pubDate><description><![CDATA[Description

有N个位置，M个操作。操作有两种，每次操作如果是1 a b c的形式表示在第a个位置到第b个位置，每个位置加入一个数c
如果是2 a b c形式，表示询问从第a个位置到第b个位置，第C大的数是多少。

Input

第一行N，M
接下来M行，每行形如1 a b c或2 a b c

Output

输出每个询问的结果

Sample Input]]></description><category></category></item><item><title><![CDATA[2002: [Hnoi2010]Bounce 弹飞绵羊（分块）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/48623089</link><guid>https://blog.youkuaiyun.com/a305657/article/details/48623089</guid><author>a305657</author><pubDate>Mon, 21 Sep 2015 10:39:27 +0800</pubDate><description><![CDATA[Description

某天，Lostmonkey发明了一种超级弹力装置，为了在他的绵羊朋友面前显摆，他邀请小绵羊一起玩个游戏。游戏一开始，Lostmonkey在地上沿着一条直线摆上n个装置，每个装置设定初始弹力系数ki，当绵羊达到第i个装置时，它会往后弹ki步，达到第i+ki个装置，若不存在第i+ki个装置，则绵羊被弹飞。绵羊想知道当它从第i个装置起步时，被弹几次后会被弹飞。为了使得游戏更]]></description><category></category></item><item><title><![CDATA[ural1960Palindromes and Super Abilities（回文树）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/47139051</link><guid>https://blog.youkuaiyun.com/a305657/article/details/47139051</guid><author>a305657</author><pubDate>Thu, 30 Jul 2015 00:41:52 +0800</pubDate><description><![CDATA[回文树根据以下博客学的，写得很好
传送门：http://blog.youkuaiyun.com/u013368721/article/details/42100363


After solving seven problems on Timus Online Judge with a word “palindrome” in the problem name, Misha has got an un]]></description><category></category></item><item><title><![CDATA[GDCPC2015]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/46047831</link><guid>https://blog.youkuaiyun.com/a305657/article/details/46047831</guid><author>a305657</author><pubDate>Wed, 27 May 2015 16:43:17 +0800</pubDate><description><![CDATA[这两天忙着赶实习的任务。所以总结就拖到现在了。
先简单记录下比赛吧。
这次队名改成了Hold_the_crash。背后的故事这里就不说了= =。
本场也是12题。依旧是WJ前4，我中4，SF后4。
开场就看E。水题一个。就上去搞。太久没打现场赛有点虚，多测了几组数据。19min/1A。然后榜上有不少人过了L。SF开艹。wa了发。我看了下，感觉似乎不用按顺序。SF改了下43min/2A。然后]]></description><category></category></item><item><title><![CDATA[几种常见取石子模型]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/44748469</link><guid>https://blog.youkuaiyun.com/a305657/article/details/44748469</guid><author>a305657</author><pubDate>Mon, 30 Mar 2015 11:31:33 +0800</pubDate><description><![CDATA[由poj
 1067引发的——取石子游戏【各类取石子总结】





上次做poj 1067的取石子游戏，只用到了whthoff博弈，未涉及到取石子的异或方法，今天重新搜索，整理了一遍。搜罗各种资料，加上自己整理，终于成篇啦！……噼里啪啦

 

取石子问题

有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光]]></description><category></category></item><item><title><![CDATA[大视野1096--[ZJOI2007]仓库建设(斜率优化DP)]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43447275</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43447275</guid><author>a305657</author><pubDate>Tue, 03 Feb 2015 11:30:01 +0800</pubDate><description><![CDATA[Description

L公司有N个工厂，由高到底分布在一座山上。如图所示，工厂1在山顶，工厂N在山脚。 由于这座山处于高原内陆地区（干燥少雨），L公司一般把产品直接堆放在露天，以节省费用。突然有一天，L公司的总裁L先生接到气象部门的电话，被告知三天之后将有一场暴雨，于是L先生决定紧急在某些工厂建立一些仓库以免产品被淋坏。由于地形的不同，在不同工厂建立仓库的费用可能是不同的。第i个工厂目前已]]></description><category></category></item><item><title><![CDATA[HDU2191(单调队列优化DP)]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43341897</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43341897</guid><author>a305657</author><pubDate>Sat, 31 Jan 2015 16:31:19 +0800</pubDate><description><![CDATA[Problem Description

急！灾区的食物依然短缺！
为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你一共有资金n元，而市场有m种大米，每种大米都是袋装产品，其价格不等，并且只能整袋购买。
请问：你用有限的资金最多能采购多少公斤粮食呢？

后记：
人生是一个充满了变数的生命过程，天灾、人祸、病痛是我们生命历程中不可预知的威胁。
月有阴晴]]></description><category></category></item><item><title><![CDATA[[转]中国剩余定理]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43193827</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43193827</guid><author>a305657</author><pubDate>Tue, 27 Jan 2015 13:41:03 +0800</pubDate><description><![CDATA[中国剩余定理可以描述为：
若某数x分别被d1、、…、dn除得的余数为r1、r2、…、rn，则可表示为下式：
x=R1r1+R2r2+…+Rnrn+RD
其中R1是d2、d3、…、dn的公倍数，而且被d1除，余数为1；（称为R1相对于d1的数论倒数）
R1 、
R2 、
…  、
Rn是d1、d2、…、dn-1的公倍数，而且被dn除，余数为1；
D是d1、d2、…、的最小公倍数；]]></description><category></category></item><item><title><![CDATA[[转]欧拉函数公式及其证明]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43191871</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43191871</guid><author>a305657</author><pubDate>Tue, 27 Jan 2015 10:44:26 +0800</pubDate><description><![CDATA[欧拉函数：
欧拉函数是数论中很重要的一个函数，欧拉函数是指：对于一个正整数 n
，小于 n
且和 n
互质的正整数（包括 1）的个数，记作φ(n)
。

完全余数集合：
定义小于 n
且和 n
互质的数构成的集合为 Zn
，称呼这个集合为 n
的完全余数集合。显然 |Zn|
＝φ(n)
。

有关性质：
对于素数 p
，φ(p) = p-1
。
对于两个不同]]></description><category></category></item><item><title><![CDATA[[转]扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43164241</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43164241</guid><author>a305657</author><pubDate>Mon, 26 Jan 2015 22:13:40 +0800</pubDate><description><![CDATA[欧几里德算法

欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。gcd函数就是用来求(a,b)的最大公约数的。

 

gcd函数的基本性质：

性质一：gcd(a,b)=gcd(b,a)=gcd(-a,b)=gcd(|a|,|b|)

证明略。

 

性质二：gcd(a,b)=gcd(b,a mod b)

证明：a可以表示成a = kb + r]]></description><category></category></item><item><title><![CDATA[HDU2255--奔小康赚大钱（KM算法）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43150897</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43150897</guid><author>a305657</author><pubDate>Mon, 26 Jan 2015 12:43:22 +0800</pubDate><description><![CDATA[Problem Description

传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。
这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。
另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于]]></description><category></category></item><item><title><![CDATA[POJ1160--Post Office（四边形不等式优化）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43094069</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43094069</guid><author>a305657</author><pubDate>Sat, 24 Jan 2015 22:51:07 +0800</pubDate><description><![CDATA[Description

There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coor]]></description><category></category></item><item><title><![CDATA[HDU3507--Print Article(斜率优化DP)]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/43066627</link><guid>https://blog.youkuaiyun.com/a305657/article/details/43066627</guid><author>a305657</author><pubDate>Fri, 23 Jan 2015 23:21:40 +0800</pubDate><description><![CDATA[Problem Description

Zero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will cert]]></description><category></category></item><item><title><![CDATA[2014ACM-ICPC牡丹江+鞍山总结]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/40564669</link><guid>https://blog.youkuaiyun.com/a305657/article/details/40564669</guid><author>a305657</author><pubDate>Wed, 29 Oct 2014 00:25:50 +0800</pubDate><description><![CDATA[10月8号：
    晚上8点出发。坐火车！！好怀念让我们坐飞机的老院长。。。
    10.9~10.10
    想想这是我第一次坐火车。从广州到哈尔滨整整坐了40多钟，晚点7小时也是醉了。。10号下午2点多才到哈尔滨，从哈尔滨去牡丹江的火车也已经开了！我们只能搭下一班。。。随便找了间又贵又难吃的店挫了顿然后就四处游荡、、
    改了晚上6点的火车去牡丹江，硬座。
    晚上11]]></description><category></category></item><item><title><![CDATA[HDU1007--最小点对]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/40115797</link><guid>https://blog.youkuaiyun.com/a305657/article/details/40115797</guid><author>a305657</author><pubDate>Wed, 15 Oct 2014 19:28:04 +0800</pubDate><description><![CDATA[Problem Description

Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the ]]></description><category></category></item><item><title><![CDATA[SPOJ--Count on a tree II(树上莫队)]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/40060953</link><guid>https://blog.youkuaiyun.com/a305657/article/details/40060953</guid><author>a305657</author><pubDate>Tue, 14 Oct 2014 00:50:13 +0800</pubDate><description><![CDATA[Description

 

You are given a tree with N nodes.The tree nodes are numbered from 1 to N.Each node has an integer weight.
We will ask you to perfrom the following operation:

u v : ask for how]]></description><category></category></item><item><title><![CDATA[SETI--后缀数组]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/39853643</link><guid>https://blog.youkuaiyun.com/a305657/article/details/39853643</guid><author>a305657</author><pubDate>Tue, 07 Oct 2014 13:49:15 +0800</pubDate><description><![CDATA[-

Problem Description

      Amateur astronomers Tom and Bob try to find radio broadcasts of extraterrestrial civilizations in the air. Recently they received some strange signal and represented ]]></description><category></category></item><item><title><![CDATA[HDU4787--GRE Words Revenge(在线AC自动机)]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/39671339</link><guid>https://blog.youkuaiyun.com/a305657/article/details/39671339</guid><author>a305657</author><pubDate>Mon, 29 Sep 2014 15:55:31 +0800</pubDate><description><![CDATA[Problem Description

　　Now Coach Pang is preparing for the Graduate Record Examinations as George did in 2011. At each day, Coach Pang can:
　　"+w": learn a word w
　　"?p": read a paragraph p, and c]]></description><category></category></item><item><title><![CDATA[HDU5044--Tree（树链剖分）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/39613797</link><guid>https://blog.youkuaiyun.com/a305657/article/details/39613797</guid><author>a305657</author><pubDate>Sat, 27 Sep 2014 18:38:59 +0800</pubDate><description><![CDATA[Problem Description

You are given a tree (an acyclic undirected connected graph) with N nodes. The tree nodes are numbered from 1 to N

There are N - 1 edges numbered from 1 to N - 1.

Each nod]]></description><category></category></item><item><title><![CDATA[HDU5029--Relief grain（树链剖分）]]></title><link>https://blog.youkuaiyun.com/a305657/article/details/39501759</link><guid>https://blog.youkuaiyun.com/a305657/article/details/39501759</guid><author>a305657</author><pubDate>Tue, 23 Sep 2014 17:58:26 +0800</pubDate><description><![CDATA[Problem Description
The soil is cracking up because of the drought and the rabbit kingdom is facing a serious famine. The RRC(Rabbit Red Cross) organizes the distribution of relief grain in the disas]]></description><category></category></item></channel></rss>