<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[BlackJack]]></title><description><![CDATA[AFO]]></description><link>https://blog.youkuaiyun.com/BlackJack_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; BlackJack_]]></copyright><item><title><![CDATA[可能是最后一篇了]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/82933316</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/82933316</guid><author>BlackJack_</author><pubDate>Wed, 03 Oct 2018 19:23:09 +0800</pubDate><description><![CDATA[ 

]]></description><category></category></item><item><title><![CDATA[拉格朗日插值法代码实现]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80958965</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80958965</guid><author>BlackJack_</author><pubDate>Sun, 08 Jul 2018 14:26:50 +0800</pubDate><description><![CDATA[给出一道例题有三个函数如下现给定k,n,A,d及模数p，求这三个函数在n的取值，每个测试点T组数据1&amp;lt;=T&amp;lt;=5，1&amp;lt;=n,d&amp;lt;=1e9 ，0&amp;lt;=A&amp;lt;=1e9，1&amp;lt;=k&amp;lt;=1e3，1e9&amp;lt;=p&amp;lt;2^31且p为质数题解如下那么如何实现拉格朗日插值呢看代码#include&amp;lt;cmath&amp;gt;
#include&amp;lt;ctime&amp;gt;
]]></description><category></category></item><item><title><![CDATA[LOJ #2537. 「PKUWC2018」Minimax 线段树合并]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80779287</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80779287</guid><author>BlackJack_</author><pubDate>Fri, 22 Jun 2018 22:31:04 +0800</pubDate><description><![CDATA[#2537. 「PKUWC2018」Minimax内存限制：512 MiB时间限制：1000 ms标准输入输出题目类型：传统评测方式：文本比较上传者： samzhang提交提交记录统计讨论测试数据题目描述小 CCC 有一棵 nnn 个结点的有根树，根是 111 号结点，且每个结点最多有两个子结点。定义结点 xxx 的权值为：1.若 xxx 没有子结点，那么它的权值会在输入里给出，保证这类点中每个结...]]></description><category></category></item><item><title><![CDATA[BZOJ 2216: [Poi2011]Lightning Conductor 决策单调性]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80709453</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80709453</guid><author>BlackJack_</author><pubDate>Fri, 15 Jun 2018 20:20:40 +0800</pubDate><description><![CDATA[2216: [Poi2011]Lightning ConductorTime Limit: 25 Sec  Memory Limit: 64 MBSubmit: 1516  Solved: 554[Submit][Status][Discuss]Description已知一个长度为n的序列a1,a2,...,an。对于每个1&amp;lt;=i&amp;lt;=n，找到最小的非负整数p满足 对于任意的j, aj ...]]></description><category></category></item><item><title><![CDATA[BZOJ 1563: [NOI2009]诗人小G 决策单调性]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80670879</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80670879</guid><author>BlackJack_</author><pubDate>Tue, 12 Jun 2018 20:43:14 +0800</pubDate><description><![CDATA[1563: [NOI2009]诗人小GTime Limit: 100 Sec  Memory Limit: 64 MBSubmit: 2856  Solved: 936[Submit][Status][Discuss]DescriptionInputOutput对于每组数据，若最小的不协调度不超过1018，则第一行一个数表示不协调度若最小的不协调度超过1018，则输出&quot;Too hard to ar...]]></description><category></category></item><item><title><![CDATA[UOJ #35. 后缀排序 后缀自动机构造后缀树维护后缀数组]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80657263</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80657263</guid><author>BlackJack_</author><pubDate>Mon, 11 Jun 2018 20:17:08 +0800</pubDate><description><![CDATA[把串倒过来建后缀自动机得到的就是parent树就是后缀树后缀树的遍历一发就得到后缀数组了转移版 便于理解#include&amp;lt;cmath&amp;gt;
#include&amp;lt;ctime&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cstdlib&amp;gt;
#include&amp;lt;iostream&amp;gt;
#include...]]></description><category></category></item><item><title><![CDATA[BZOJ 3083: 遥远的国度 树链剖分 线段树 换根分类讨论]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80580948</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80580948</guid><author>BlackJack_</author><pubDate>Tue, 05 Jun 2018 14:38:21 +0800</pubDate><description><![CDATA[3083: 遥远的国度Time Limit: 10 Sec  Memory Limit: 512 MBSubmit: 4587  Solved: 1255[Submit][Status][Discuss]Description描述zcwwzdjn在追杀十分sb的zhx，而zhx逃入了一个遥远的国度。当zcwwzdjn准备进入遥远的国度继续追杀时，守护神RapiD阻拦了zcwwzdjn的去路，他需要...]]></description><category></category></item><item><title><![CDATA[AtCoder Regular Contest 063 F : Snuke’s Coloring 2 利用性质 单调栈 线段树]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80446302</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80446302</guid><author>BlackJack_</author><pubDate>Fri, 25 May 2018 08:40:21 +0800</pubDate><description><![CDATA[F - すぬけ君の塗り絵 2 / Snuke's Coloring 2Time limit : 4sec / Memory limit : 256MBScore : 1600 pointsProblem StatementThere is a rectangle in the xy-plane, with its lower left corner at (0,0) and its upper r...]]></description><category></category></item><item><title><![CDATA[[SDOI2018] 战略游戏 点双联通分量 虚树]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80362694</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80362694</guid><author>BlackJack_</author><pubDate>Fri, 18 May 2018 12:25:01 +0800</pubDate><description><![CDATA[

这是一道只要前置技能解锁足够即可AC的题 
可以BJ不够 泪 
我怎么可以不会点双呢。。。

点双缩点 
每次建虚树 
做完了

&amp;amp;amp;amp;amp;nbsp;  


#include&amp;amp;amp;amp;amp;lt;cmath&amp;amp;amp;amp;amp;gt;
#include&amp;amp;amp;amp;amp;lt;ctime&amp;amp;amp;amp;amp;gt;
#include&amp;amp;amp;amp;amp;lt;cs]]></description><category></category></item><item><title><![CDATA[Codeforces Round #483 (Div. 1) D. Arkady and Rectangles 扫描线 线段树套平衡树]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80351087</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80351087</guid><author>BlackJack_</author><pubDate>Thu, 17 May 2018 15:03:06 +0800</pubDate><description><![CDATA[ 


这个题要求解最后的颜色数 
显然二维线段树可以选择，但是空间过大 
那我们应该如何进行维护呢

考虑扫描线 
对于非扫描的一维维护线段树 
由于颜色很多，在扫描线上又要支持删除，所以考虑对颜色的集合进行维护 
每个节点保存这个区间是否被完全覆盖、可以用来更新答案的最大颜色是哪个、最小的裸露在外的颜色是哪个 
可以用平衡树维护这个集合从而进行节点信息的更新

#include&amp;amp;amp;amp;amp;lt;cmat...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #483 (Div. 1) E. NN country 树上倍增 贪心 欧拉序]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/80339434</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/80339434</guid><author>BlackJack_</author><pubDate>Wed, 16 May 2018 16:52:28 +0800</pubDate><description><![CDATA[ 




#include&amp;amp;lt;cmath&amp;amp;gt;
#include&amp;amp;lt;ctime&amp;amp;gt;
#include&amp;amp;lt;cstdio&amp;amp;gt;
#include&amp;amp;lt;cstring&amp;amp;gt;
#include&amp;amp;lt;cstdlib&amp;amp;gt;
#include&amp;amp;lt;iostream&amp;amp;gt;
#include&amp;a]]></description><category></category></item><item><title><![CDATA[BZOJ 4843: [Neerc2016]Expect to Wait 二分]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79990216</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79990216</guid><author>BlackJack_</author><pubDate>Wed, 18 Apr 2018 15:00:08 +0800</pubDate><description><![CDATA[4843: [Neerc2016]Expect to WaitTime Limit: 10 Sec  Memory Limit: 128 MBSubmit: 112  Solved: 60[Submit][Status][Discuss]Descriptionls最近开了一家图书馆，大家听说是ls开的，纷纷过来借书，自然就会出现供不应求的情况，	并且借书的过程类似一个队列，每次有人来借书就将它加至...]]></description><category></category></item><item><title><![CDATA[BZOJ 5281: [Usaco2018 Open]Talent Show 01分数规划 背包dp判定]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79890658</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79890658</guid><author>BlackJack_</author><pubDate>Wed, 11 Apr 2018 08:31:52 +0800</pubDate><description><![CDATA[5281: [Usaco2018 Open]Talent ShowTime Limit: 10 Sec  Memory Limit: 128 MBSubmit: 6  Solved: 4[Submit][Status][Discuss]DescriptionFarmerJohn要带着他的N头奶牛，方便起见编号为1…N，到农业展览会上去，参加每年的达牛秀！他的第i头奶牛重量为wi，才艺水平为ti，两...]]></description><category></category></item><item><title><![CDATA[扩展埃拉托色尼筛法]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79872033</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79872033</guid><author>BlackJack_</author><pubDate>Mon, 09 Apr 2018 20:24:24 +0800</pubDate><description><![CDATA[原文链接http://www.spoj.com/problems/TEES/]]></description><category></category></item><item><title><![CDATA[BZOJ 2618: [Cqoi2006]凸多边形 半平面交]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79867286</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79867286</guid><author>BlackJack_</author><pubDate>Mon, 09 Apr 2018 15:30:35 +0800</pubDate><description><![CDATA[2618: [Cqoi2006]凸多边形Time Limit: 5 Sec  Memory Limit: 128 MBSubmit: 2141  Solved: 1051[Submit][Status][Discuss]Description逆时针给出n个凸多边形的顶点坐标，求它们交的面积。例如n=2时，两个凸多边形如下图：则相交部分的面积为5.233。Input第一行有一个整数n，表示凸多边形的...]]></description><category></category></item><item><title><![CDATA[BZOJ 4241: 历史研究 回滚莫队]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79849999</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79849999</guid><author>BlackJack_</author><pubDate>Sun, 08 Apr 2018 13:07:58 +0800</pubDate><description><![CDATA[4241: 历史研究Time Limit: 80 Sec  Memory Limit: 512 MBSubmit: 1514  Solved: 461[Submit][Status][Discuss]DescriptionIOI国历史研究的第一人——JOI教授，最近获得了一份被认为是古代IOI国的住民写下的日记。JOI教授为了通过这份日记来研究古代IOI国的生活，开始着手调查日记中记载的事件。日记...]]></description><category></category></item><item><title><![CDATA[BZOJ 3224: Tyvj 1728 普通平衡树 Splay]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79827322</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79827322</guid><author>BlackJack_</author><pubDate>Thu, 05 Apr 2018 16:46:33 +0800</pubDate><description><![CDATA[3224: Tyvj 1728 普通平衡树Time Limit: 10 Sec  Memory Limit: 128 MBSubmit: 15689  Solved: 6832[Submit][Status][Discuss]Description您需要写一种数据结构（可参考题目标题），来维护一些数，其中需要提供以下操作：1. 插入x数2. 删除x数(若有多个相同的数，因只删除一个)3. 查询x数...]]></description><category></category></item><item><title><![CDATA[BZOJ 3991: [SDOI2015]寻宝游戏 虚树 set]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79780509</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79780509</guid><author>BlackJack_</author><pubDate>Sun, 01 Apr 2018 19:07:47 +0800</pubDate><description><![CDATA[3991: [SDOI2015]寻宝游戏Time Limit: 40 Sec  Memory Limit: 128 MBSubmit: 1651  Solved: 810[Submit][Status][Discuss]Description 小B最近正在玩一个寻宝游戏，这个游戏的地图中有N个村庄和N-1条道路，并且任何两个村庄之间有且仅有一条路径可达。游戏开始时，玩家可以任意选择一个村庄，瞬间转...]]></description><category></category></item><item><title><![CDATA[BZOJ 2821: 作诗(Poetize)  分块]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79730006</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79730006</guid><author>BlackJack_</author><pubDate>Wed, 28 Mar 2018 16:57:03 +0800</pubDate><description><![CDATA[2821: 作诗(Poetize)Time Limit: 50 Sec  Memory Limit: 128 MBSubmit: 3356  Solved: 982[Submit][Status][Discuss]Description神犇SJY虐完HEOI之后给傻×LYD出了一题：SHY是T国的公主，平时的一大爱好是作诗。由于时间紧迫，SHY作完诗之后还要虐OI，于是SHY找来一篇长度为N的文章...]]></description><category></category></item><item><title><![CDATA[BZOJ 2653: middle 二分 主席树]]></title><link>https://blog.youkuaiyun.com/BlackJack_/article/details/79720113</link><guid>https://blog.youkuaiyun.com/BlackJack_/article/details/79720113</guid><author>BlackJack_</author><pubDate>Tue, 27 Mar 2018 22:25:03 +0800</pubDate><description><![CDATA[2653: middleTime Limit: 20 Sec  Memory Limit: 512 MBSubmit: 2169  Solved: 1203[Submit][Status][Discuss]Description一个长度为n的序列a，设其排过序之后为b，其中位数定义为b[n/2]，其中a,b从0开始标号,除法取下整。给你一个长度为n的序列s。回答Q个这样的询问：s的左端点在[a,b...]]></description><category></category></item></channel></rss>