<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[KJJD7的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/KJJD7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; KJJD7]]></copyright><item><title><![CDATA[2020CCPC河南省赛 E 发通知（离散+差分|map）]]></title><link>https://blog.youkuaiyun.com/KJJD7/article/details/130177281</link><guid>https://blog.youkuaiyun.com/KJJD7/article/details/130177281</guid><author>KJJD7</author><pubDate>Sat, 15 Apr 2023 23:46:41 +0800</pubDate><description><![CDATA[对于通知信息，同学们的反应往往各不相同，辅导员预测出第 i 号学生收到通知后会产生 wi 的愉悦度。辅导员会选择在某一时刻发布一次通知消息，他希望在至少有 k 名同学收到通知的前提下，使得同学们的总体愉悦度最大。同学们的总体愉悦度是所有同学愉悦度的异或和。思路：一开始想的是滑动窗口，但是很快发现不是越多越好，异或和是不确定的。那么就是找会产生的点，那就是2*n个端点（注意r要+1，因为是闭区间）。那么就是算贡献了，看了别人是离散化，而我就直接用了map（懒就是这样的）。但卡了好一会，该谢罪了。]]></description><category></category></item><item><title><![CDATA[P1120 小木棍]]></title><link>https://blog.youkuaiyun.com/KJJD7/article/details/129144715</link><guid>https://blog.youkuaiyun.com/KJJD7/article/details/129144715</guid><author>KJJD7</author><pubDate>Tue, 21 Feb 2023 16:09:27 +0800</pubDate><description><![CDATA[P1120 小木棍  题解]]></description><category></category></item><item><title><![CDATA[CFA. Vacations题解，一维DP]]></title><link>https://blog.youkuaiyun.com/KJJD7/article/details/128756418</link><guid>https://blog.youkuaiyun.com/KJJD7/article/details/128756418</guid><author>KJJD7</author><pubDate>Tue, 24 Jan 2023 14:28:51 +0800</pubDate><description><![CDATA[DP]]></description><category></category></item></channel></rss>