<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Asuna_acmer]]></title><description><![CDATA[——Kurisu、红]]></description><link>https://blog.youkuaiyun.com/GrassTreeFlower</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GrassTreeFlower]]></copyright><item><title><![CDATA[HDU 3565 Bi-peak Number [数位DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/51084793</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/51084793</guid><author>GrassTreeFlower</author><pubDate>Thu, 07 Apr 2016 12:42:19 +0800</pubDate><description><![CDATA[定义一种双峰数，这个数由两座山峰构成，每一座山峰至少三个数，且第一位不为0，保证其先递增，后递减，每一部分的数不少于2个（最高数共用），每一个双峰数能够得到的分数是每一位上的数字相加，问区间[A,B]内所有的双峰数的分数中的最大值。]]></description><category></category></item><item><title><![CDATA[HDU 3271 SNIBB[数位DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50907067</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50907067</guid><author>GrassTreeFlower</author><pubDate>Wed, 16 Mar 2016 17:50:44 +0800</pubDate><description><![CDATA[给出一个SNIBB的定义，即一个十进制数N在B进制的情况下，每一位上的数加起来的和。2种询问，第一种：区间[A,B]内所有SNIBB恰好等于M的数的个数。第二种：区间[A,B]内第K个SNIBB恰好等于M的数是什么。]]></description><category></category></item><item><title><![CDATA[HDU 3943 K-th Nya Number [数位DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50906970</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50906970</guid><author>GrassTreeFlower</author><pubDate>Wed, 16 Mar 2016 17:40:30 +0800</pubDate><description><![CDATA[问（P,Q]范围内，第K个恰有X个4，Y个7的数。]]></description><category></category></item><item><title><![CDATA[FZU 2113 Jason的特殊爱好 [数位DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50906735</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50906735</guid><author>GrassTreeFlower</author><pubDate>Wed, 16 Mar 2016 17:23:40 +0800</pubDate><description><![CDATA[输出a到b之间的整数包含多少个1。]]></description><category></category></item><item><title><![CDATA[HDU 5293 Tree chain problem [树链剖分+线段树+树形DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50828998</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50828998</guid><author>GrassTreeFlower</author><pubDate>Tue, 08 Mar 2016 17:40:09 +0800</pubDate><description><![CDATA[给出N个点的树，M条树链，树链有权，问在取出的树链互不相交的情况下，权值和最大是多少。]]></description><category></category></item><item><title><![CDATA[BZOJ 8843 染色 [树链剖分+区间线段树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50805553</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50805553</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 21:28:43 +0800</pubDate><description><![CDATA[给出一个树，树上每个点有颜色，两种操作：1）将路径,<X,Y> 上的点颜色全部改成C ；2）询问路径<X,Y> 上的颜色段数，11221为3段。]]></description><category></category></item><item><title><![CDATA[SPOJ QTREE Query on a tree [树链剖分+线段树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50804771</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50804771</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 18:40:49 +0800</pubDate><description><![CDATA[给一棵树，边有权，两种操作：1）修改一条边的权值  2） 询问某条路径上的最大边权]]></description><category></category></item><item><title><![CDATA[BZOJ 4016 最短路径树问题 [最短路+树分治]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801657</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801657</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 12:26:27 +0800</pubDate><description><![CDATA[给出一图，边有权，先根据此图建最短路径树（保证每个点的父节点字典序最小），然后询问树上恰好经过K个点的路径中，边权和的最大值，以及达到最大值的路径数。]]></description><category></category></item><item><title><![CDATA[HDU 4812	 D Tree [树分治]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801522</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801522</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 12:04:51 +0800</pubDate><description><![CDATA[给出一棵树，点有权，问是否存在路径使其路径上的权值和MOD 1e6+3为K，若有输出字典序最小的点对<u，v>，否则输出No soluction]]></description><category></category></item><item><title><![CDATA[BZOJ 2152 聪聪可可 [树分治 or 树形DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801424</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50801424</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 11:46:07 +0800</pubDate><description><![CDATA[给出一棵树，边有权，问随机取两点，其路径上的边权和整除3的概率，以最简分数的形式给出答案。]]></description><category></category></item><item><title><![CDATA[UVALive 6900 Road Repair [树分治+线段树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50800372</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50800372</guid><author>GrassTreeFlower</author><pubDate>Fri, 04 Mar 2016 10:49:54 +0800</pubDate><description><![CDATA[有一棵树，树上每条边都有其花费和收益，找一条简单路径，使花费在<=C的情况下，收益最大，输出最大收益。]]></description><category></category></item><item><title><![CDATA[POJ 1741 Tree [树上点分治]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50791914</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50791914</guid><author>GrassTreeFlower</author><pubDate>Thu, 03 Mar 2016 21:40:39 +0800</pubDate><description><![CDATA[给出一棵树，问树上点对<A,B>所代表的简单路径长度<=K的不同点对数。]]></description><category></category></item><item><title><![CDATA[POJ 1655 Balancing Act [求树的重心]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50791878</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50791878</guid><author>GrassTreeFlower</author><pubDate>Thu, 03 Mar 2016 21:32:46 +0800</pubDate><description><![CDATA[给出一棵树，求该树的重心。]]></description><category></category></item><item><title><![CDATA[ZOJ 2112 Dynamic Rankings [树状数组套主席树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50786349</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50786349</guid><author>GrassTreeFlower</author><pubDate>Thu, 03 Mar 2016 10:18:56 +0800</pubDate><description><![CDATA[给出N个数，M个询问L,R,K，对于每个询问给出区间（L,R）内的第K小值，支持修改。]]></description><category></category></item><item><title><![CDATA[SPOJ D-query 区间不同数的个数 [在线主席树 or 离线树状数组]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50786160</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50786160</guid><author>GrassTreeFlower</author><pubDate>Thu, 03 Mar 2016 09:56:46 +0800</pubDate><description><![CDATA[给出N个数，M个询问，每次询问给出区间内不同数的个数。]]></description><category></category></item><item><title><![CDATA[HDU 4348 / SPOJ TTM  To the moon [主席树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50765873</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50765873</guid><author>GrassTreeFlower</author><pubDate>Mon, 29 Feb 2016 15:42:06 +0800</pubDate><description><![CDATA[给出N个数的序列，有四种操作：
1.成段区间加D，此时的序列有一个时间T来表示它（每次操作1之后T+1）
2.询问当前序列区间和
3.询问T时刻序列的区间和
4.回到T时刻]]></description><category></category></item><item><title><![CDATA[CodeForces 547E Mike and Friends [Fail树+树状数组]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50763275</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50763275</guid><author>GrassTreeFlower</author><pubDate>Mon, 29 Feb 2016 09:42:40 +0800</pubDate><description><![CDATA[给出N个串，M个询问，对于每个询问L,R,K，给出串L到串R的所有串中串K作为子串出现了几次。（Fail树写法）]]></description><category></category></item><item><title><![CDATA[CodeForces 547E Mike and Friends [后缀树组+主席树]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50756749</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50756749</guid><author>GrassTreeFlower</author><pubDate>Sat, 27 Feb 2016 20:30:52 +0800</pubDate><description><![CDATA[给出N个串，M个询问，对于每个询问L,R,K，给出串L到串R的所有串中串K作为子串出现了几次。]]></description><category></category></item><item><title><![CDATA[对于一类离散的概率DP问题的总结（第一次）]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50221689</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50221689</guid><author>GrassTreeFlower</author><pubDate>Tue, 08 Dec 2015 17:32:11 +0800</pubDate><description><![CDATA[——对最近做的一些简单概率DP题的总结]]></description><category></category></item><item><title><![CDATA[ZOJ 3640 Help Me Escape [概率DP]]]></title><link>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50221429</link><guid>https://blog.youkuaiyun.com/GrassTreeFlower/article/details/50221429</guid><author>GrassTreeFlower</author><pubDate>Tue, 08 Dec 2015 17:08:44 +0800</pubDate><description><![CDATA[Now Cain is unexpectedly trapped in a cave with N paths. —— 给出N条逃跑路径，每条路径有一个困难值Ci，Cain要逃跑，一开始其有战斗值f，他可以花费一个单位的时间来等概率随机选择其中一条路径逃跑，如果其战斗值f大于Ci，则在经过Ti时间（公式如上）后成功，如果小于等于，则失败（不会多花时间），且战斗值f增长Ci，问逃跑所需要的时间的期望。]]></description><category></category></item></channel></rss>