<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Selfishness_x的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Selfishness_x</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Selfishness_x]]></copyright><item><title><![CDATA[补题记录牛客]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131616464</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131616464</guid><author>Selfishness_x</author><pubDate>Sat, 08 Jul 2023 23:34:05 +0800</pubDate><description><![CDATA[牛客~第五届SCPC中南民族大学程序设计竞赛（同步赛）（重现赛）]]></description><category></category></item><item><title><![CDATA[7.3补题记录]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131505342</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131505342</guid><author>Selfishness_x</author><pubDate>Mon, 03 Jul 2023 22:06:59 +0800</pubDate><description><![CDATA[思路：定义两个DP数组，第一个DP数组用来存储从(1, 1)到任何位置所能获得的最大宝藏价值，第二个DP数组用来存储从(n, m)到任何位置所能获得的最大宝藏价值，因为传送门的数据范围较小，所以我们可以枚举任意两个传送门的位置，求经过这两个传送门后所能获得的最大宝藏价值，最后把枚举的所有价值中取最大的那个即可（因为宝藏有负权价值，所以还有一种情况就是不走任何传送门直接从(1, 1)走到(n, m)）本题进行二分算法进行计算。]]></description><category></category></item><item><title><![CDATA[7.1补题记录]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131494161</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131494161</guid><author>Selfishness_x</author><pubDate>Sat, 01 Jul 2023 21:37:31 +0800</pubDate><description><![CDATA[由题意可以发现实际上Bob的操作无法影响到Alice的操作，所以直接计算Alice需要几步使字符串字符类型和数量相同，当Alice完成时，判断另一个数组为正序还是逆序。贪心的考虑：找到 l, r 从最高位开始的第一位不相等的十进制位，r 和 l 的这一位交换，后面的一个全取 9，一个全取 0 即可。A变一个，B翻转一个；大意~：A想结束快，B想时间长。]]></description><category></category></item><item><title><![CDATA[6.29补题记录]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131459588</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131459588</guid><author>Selfishness_x</author><pubDate>Thu, 29 Jun 2023 22:20:03 +0800</pubDate><description><![CDATA[给每一个人(g-1)/2块银币，那么一共需要(g-1)/2*n块银币，等加以省下(g-1)/2*n块银币，也就是(g-1)/2*n/g块金币，最多有k块金币，在这里需要判断一下最多能够有几块金币，然后得到了最大满足的金币数量min((g-1)/2*n/g,k)，金币的价值也就是省下来的银币，乘以g就可以求解。再在1~N范围内从小到大枚举因子i，并且枚举从i ~ N的i的倍数，累计出现的次数，那么a必须满足abs(a-1)>k或者abs(a-n)>k，b必须满足abs(b-1)>k或者abs(b-n)>k。]]></description><category></category></item><item><title><![CDATA[6.28补题记录]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131444649</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131444649</guid><author>Selfishness_x</author><pubDate>Thu, 29 Jun 2023 16:38:39 +0800</pubDate><description><![CDATA[【代码】6.28补题记录。]]></description><category></category></item><item><title><![CDATA[6.27补题记录]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/131424090</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/131424090</guid><author>Selfishness_x</author><pubDate>Tue, 27 Jun 2023 22:19:12 +0800</pubDate><description><![CDATA[题意：有n个节点，n-1条边，1是根节点，每个节点最多两个子节点，其中有2个苹果在点上，他会进入子节点，如果他下面有两个子节点，那么会进入任意一个，问你q次，每次a,b表示两个苹果所在的节点，问最终两个苹果落点有多少种不同可能。在上面处理以后确保H为偶数，然后开始循环，倘若H能够被当前减数的2倍整除，那么就减去2倍的减数，否则减去当前的减数不变。（注意，如果这里的条件变为：H大于当前减数的2倍，那么久减去减数的2倍则会超时！解析：如果点a到底部有x种方案，点b到底部有y种方案，那么总方案数就是x*y。]]></description><category></category></item><item><title><![CDATA[A. Is It a Cat?]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/129480488</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/129480488</guid><author>Selfishness_x</author><pubDate>Sun, 12 Mar 2023 20:32:46 +0800</pubDate><description><![CDATA[meow为叫声，不是此种数列都是妖魔鬼怪。这个题可以纯暴力是我没有想到的...]]></description><category></category></item><item><title><![CDATA[A. Prefix and Suffix Array]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/129480277</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/129480277</guid><author>Selfishness_x</author><pubDate>Sun, 12 Mar 2023 20:17:55 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[reverse函数]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/129479937</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/129479937</guid><author>Selfishness_x</author><pubDate>Sun, 12 Mar 2023 19:51:53 +0800</pubDate><description><![CDATA[补题（偶遇技巧函数）]]></description><category></category></item><item><title><![CDATA[B. Settlement of Guinea Pigs]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/129479594</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/129479594</guid><author>Selfishness_x</author><pubDate>Sun, 12 Mar 2023 19:24:48 +0800</pubDate><description><![CDATA[InputOutput详见。]]></description><category></category></item><item><title><![CDATA[P2360 地下城主]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128744264</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128744264</guid><author>Selfishness_x</author><pubDate>Fri, 20 Jan 2023 22:32:27 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[P1588 [USACO07OPEN]Catch That Cow S]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128744005</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128744005</guid><author>Selfishness_x</author><pubDate>Fri, 20 Jan 2023 21:46:45 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[迷宫]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128743804</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128743804</guid><author>Selfishness_x</author><pubDate>Fri, 20 Jan 2023 21:16:24 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[P8661 [蓝桥杯 2018 省 B] 日志统计]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678893</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678893</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 19:59:08 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[Lex String]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678781</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678781</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 19:46:32 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[B. MKnez‘s ConstructiveForces Task]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678436</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128678436</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 19:17:27 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[B. Matrix of Differences]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128677482</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128677482</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 17:56:29 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[A. Make it Beautiful]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128673870</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128673870</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 14:36:48 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[A1. Gardener and the Capybaras (easy version)&A2]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128671617</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128671617</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 11:59:43 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[0x3f3f3f3f是什么意思]]></title><link>https://blog.youkuaiyun.com/Selfishness_x/article/details/128668628</link><guid>https://blog.youkuaiyun.com/Selfishness_x/article/details/128668628</guid><author>Selfishness_x</author><pubDate>Fri, 13 Jan 2023 01:10:07 +0800</pubDate><description><![CDATA[补充上课没好好听到的点]]></description><category></category></item></channel></rss>