<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Zvezda_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Zvezda_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Zvezda_]]></copyright><item><title><![CDATA[[BZOJ1493][NOI2007]项链工厂]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50957555</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50957555</guid><author>Zvezda_</author><pubDate>Tue, 22 Mar 2016 19:11:12 +0800</pubDate><description><![CDATA[又是一道数据结构神题,卡了一晚上…]]></description><category></category></item><item><title><![CDATA[[BZOJ1180][CROATIAN2009]OTOCI]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50949977</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50949977</guid><author>Zvezda_</author><pubDate>Mon, 21 Mar 2016 20:34:57 +0800</pubDate><description><![CDATA[LCT复习题…记得注意access()后面要不要splay()…]]></description><category></category></item><item><title><![CDATA[[BZOJ3132]上帝造题的七分钟]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50949508</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50949508</guid><author>Zvezda_</author><pubDate>Mon, 21 Mar 2016 19:29:54 +0800</pubDate><description><![CDATA[维护一个矩阵,支持范围加和范围求和.据说二维线段树做不了,用二维树状数组类似一维的差分序列技巧处理即可.]]></description><category></category></item><item><title><![CDATA[[BZOJ3404][Usaco2009 Open]Cow Digit Game又见数字游戏]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50918606</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50918606</guid><author>Zvezda_</author><pubDate>Fri, 18 Mar 2016 00:20:16 +0800</pubDate><description><![CDATA[大水题…]]></description><category></category></item><item><title><![CDATA[[BZOJ1452][JSOI2009]Count]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50918398</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50918398</guid><author>Zvezda_</author><pubDate>Thu, 17 Mar 2016 23:44:31 +0800</pubDate><description><![CDATA[二维树状数组.没看清数据范围MLE了一发,下次一定要注意看数据范围…]]></description><category></category></item><item><title><![CDATA[[BZOJ1188][HNOI2007]分裂游戏]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50918223</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50918223</guid><author>Zvezda_</author><pubDate>Thu, 17 Mar 2016 23:26:55 +0800</pubDate><description><![CDATA[发现每颗豆子是独立的,所以我们可以对每颗豆子单独考虑(看作一个组合游戏).然后直接SG即可.]]></description><category></category></item><item><title><![CDATA[[BZOJ1874][BeiJing2009 WinterCamp]取石子游戏]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50909627</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50909627</guid><author>Zvezda_</author><pubDate>Wed, 16 Mar 2016 23:42:06 +0800</pubDate><description><![CDATA[一题较简单的组合游戏.懒得自己写题解了:http://hzwer.com/2746.html (OLZ黄学长)]]></description><category></category></item><item><title><![CDATA[[BZOJ1251]序列终结者]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50899591</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50899591</guid><author>Zvezda_</author><pubDate>Tue, 15 Mar 2016 20:19:49 +0800</pubDate><description><![CDATA[维护一个序列,要求支持区间加、区间翻转、区间最值.复习Splay…手感极差,写+调了1h,感觉药丸…]]></description><category></category></item><item><title><![CDATA[[BZOJ1004][HNOI2008]Cards]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50890281</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50890281</guid><author>Zvezda_</author><pubDate>Mon, 14 Mar 2016 21:54:06 +0800</pubDate><description><![CDATA[置换群,Burnside引理的应用.注意置换群中一定有一个”不变”元素,计算时要记得考虑.]]></description><category></category></item><item><title><![CDATA[[BZOJ4300]绝世好题]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50889790</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50889790</guid><author>Zvezda_</author><pubDate>Mon, 14 Mar 2016 20:57:49 +0800</pubDate><description><![CDATA[设f[i]为以第i+1位(二进制位)有1的数结尾得到的序列的最长长度,……据说是SB题,然而智商再次下线,感觉没救了OLZ…]]></description><category></category></item><item><title><![CDATA[[BZOJ3671][Noi2014]随机数生成器]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50889752</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50889752</guid><author>Zvezda_</author><pubDate>Mon, 14 Mar 2016 20:54:15 +0800</pubDate><description><![CDATA[贪心并不难想,然而恶心的是卡内存,数组要重复利用…这题我一开始写了快速乘,怒T半天,最后发现用ll就可以了,欲哭无泪…]]></description><category></category></item><item><title><![CDATA[[BZOJ1003][ZJOI2006]物流运输trans]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50889730</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50889730</guid><author>Zvezda_</author><pubDate>Mon, 14 Mar 2016 20:51:41 +0800</pubDate><description><![CDATA[题解:
  题目大意：给定一个无向图，运输n天，其中有些天有些点不能走，更换路线代价为k，求代价总和. 
  首先令cost[i][j]为第i天到第j天都走同一路线的最小花销,这个用SPFA处理. 
  然后就是动规的问题了.令f[i]为1~i天的最小花销 
  则f[i]=min{ f[j]+cost[j+1][i]+k}(0<=<=j<<i).
表示智商已下线…一定要多刷题了…]]></description><category></category></item><item><title><![CDATA[[BZOJ1011][HNOI2008]遥远的行星]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50830662</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50830662</guid><author>Zvezda_</author><pubDate>Tue, 08 Mar 2016 21:25:14 +0800</pubDate><description><![CDATA[无力吐槽…]]></description><category></category></item><item><title><![CDATA[[HDU1426]Sudoku Killer]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50822156</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50822156</guid><author>Zvezda_</author><pubDate>Mon, 07 Mar 2016 20:43:03 +0800</pubDate><description><![CDATA[DLX第一题.]]></description><category></category></item><item><title><![CDATA[[BZOJ3101]N皇后]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50757394</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50757394</guid><author>Zvezda_</author><pubDate>Sat, 27 Feb 2016 22:42:23 +0800</pubDate><description><![CDATA[n皇后的构造法,表示不明觉厉…]]></description><category></category></item><item><title><![CDATA[[BZOJ2850]巧克力王国]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50757263</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50757263</guid><author>Zvezda_</author><pubDate>Sat, 27 Feb 2016 22:07:34 +0800</pubDate><description><![CDATA[题目大意:二维平面里给出若干个点和若干个半平面,分别求在每个半平面内的点的点权和.这个用Kdtree也很好维护.]]></description><category></category></item><item><title><![CDATA[[BZOJ3053]The Closest M Points]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50757236</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50757236</guid><author>Zvezda_</author><pubDate>Sat, 27 Feb 2016 22:02:06 +0800</pubDate><description><![CDATA[Kdtree经典问题.查找前M个最近的点.用一个堆维护最近的点集,然后按最近点查询的方法做就可以了.]]></description><category></category></item><item><title><![CDATA[[BZOJ2683]=[BZOJ4066]简单题]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50757223</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50757223</guid><author>Zvezda_</author><pubDate>Sat, 27 Feb 2016 21:59:08 +0800</pubDate><description><![CDATA[Kdtree和平衡树有些类似,只不过维护的是高维向量.我们可以模仿平衡树的方法,维护Kdtree每颗子树所代表的点集包含的信息,然后这题就解决了. 
在这一题里树会很不平衡,要插入若干次后重构整棵树,代码和build函数类似.]]></description><category></category></item><item><title><![CDATA[[BZOJ2648]=[BZOJ2716]SJY摆棋子]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50727052</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50727052</guid><author>Zvezda_</author><pubDate>Tue, 23 Feb 2016 23:41:08 +0800</pubDate><description><![CDATA[Kdtree的带插入最邻近点查询.轮流划分维度+暴力插入AC了,而且时间排名还比较靠前…]]></description><category></category></item><item><title><![CDATA[[BZOJ1941][Sdoi2010]Hide and Seek]]></title><link>https://blog.youkuaiyun.com/Zvezda_/article/details/50726429</link><guid>https://blog.youkuaiyun.com/Zvezda_/article/details/50726429</guid><author>Zvezda_</author><pubDate>Tue, 23 Feb 2016 22:08:10 +0800</pubDate><description><![CDATA[Kdtree第一题.讲一下Kdtree： 
Kdtree的用途是对高维向量(点)进行各种索引.]]></description><category></category></item></channel></rss>