<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[stdforces的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/stdforces</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; stdforces]]></copyright><item><title><![CDATA[洛谷P1345 无向图最小割点数]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/130324875</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/130324875</guid><author>stdforces</author><pubDate>Sun, 23 Apr 2023 16:32:24 +0800</pubDate><description><![CDATA[容量设为1的原因更多是反映这条路有没有流到达汇点，不需要在乎数量。此时要对无向图求最小割点数，考虑将点化成边，这样才符合最大流。，但在拆分源点汇点时，这两个点不可删去，所以内部权值要设为。对无向图，要求其最大流，只需要对双向边都建反向边即可，即。首先对于有向图，求他的最小割边，只需要令每条边的容量为。，求出起点到终点的最大流就是最小割边数了。条边的无向图，求出这副图的最小割点数。，此时同最小割边一样，将这个边权设为。]]></description><category></category></item><item><title><![CDATA[Codeforces 1798C lcm,gcd,思维]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/129827802</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/129827802</guid><author>stdforces</author><pubDate>Tue, 28 Mar 2023 23:43:24 +0800</pubDate><description><![CDATA[现在把他们装袋后按原先的糖果顺序放置，一段袋装糖果的价格如果相同，那么他们就可以用一种价格牌标注，请问最少需要多少种价格牌就可以标注所有的袋装糖果？贪心地与前面一个商品一起为一组的一定是最优结果，所以只需要双指针找满足。两个条件的物品就可以放置在一组了，要满足。，现在要把每种糖果装袋，假设第。个每袋，这样就必须要保证。]]></description><category></category></item><item><title><![CDATA[AtCoder 294F 二分套二分]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/129827783</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/129827783</guid><author>stdforces</author><pubDate>Tue, 28 Mar 2023 23:40:36 +0800</pubDate><description><![CDATA[直接二分答案，检查二分的答案在所有的情况排名第几，即有多少。注意对一杯糖水并不是加浓度更高的糖水浓度就一定更高。每次check只需要预先计算右式，排序后枚举。现在从两个人手中各取一杯糖水混合，有。的数量即可，单次check的时间复杂度是。按照上述的思路，我们不妨也考虑二分答案。种可能的情况，求出其中浓度第。两个数组各取一个元素，乘积有。这样只需要找到最后一个排名为。杯糖水，第一个人的第。]]></description><category></category></item><item><title><![CDATA[AtCoder292 E 思维]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/129407811</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/129407811</guid><author>stdforces</author><pubDate>Wed, 08 Mar 2023 17:25:25 +0800</pubDate><description><![CDATA[思维]]></description><category></category></item><item><title><![CDATA[AtCoder 259E LCM]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/129407789</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/129407789</guid><author>stdforces</author><pubDate>Wed, 08 Mar 2023 17:24:37 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[Codeforces 1787C 思维，dp]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/128979241</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/128979241</guid><author>stdforces</author><pubDate>Sat, 11 Feb 2023 00:20:28 +0800</pubDate><description><![CDATA[dp]]></description><category></category></item><item><title><![CDATA[2019银川icpc A 分组背包]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127931358</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127931358</guid><author>stdforces</author><pubDate>Fri, 18 Nov 2022 23:19:18 +0800</pubDate><description><![CDATA[分组背包]]></description><category></category></item><item><title><![CDATA[2019银川icpc K 思维，悬线法dp]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127931340</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127931340</guid><author>stdforces</author><pubDate>Fri, 18 Nov 2022 23:18:34 +0800</pubDate><description><![CDATA[悬线法dp]]></description><category></category></item><item><title><![CDATA[洛谷P4147 悬线法处理最大子矩形问题模板]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127929664</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127929664</guid><author>stdforces</author><pubDate>Fri, 18 Nov 2022 21:04:22 +0800</pubDate><description><![CDATA[线性dp]]></description><category></category></item><item><title><![CDATA[洛谷P3807 lucas定理模板]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127914362</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127914362</guid><author>stdforces</author><pubDate>Thu, 17 Nov 2022 23:44:47 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[洛谷P3807 lucas定理模板]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127914357</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127914357</guid><author>stdforces</author><pubDate>Thu, 17 Nov 2022 23:43:25 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[洛谷P3807 lucas定理模板]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127914342</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127914342</guid><author>stdforces</author><pubDate>Thu, 17 Nov 2022 23:41:37 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[2019银川icpc F 数论分块，技巧]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127891985</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127891985</guid><author>stdforces</author><pubDate>Wed, 16 Nov 2022 19:51:31 +0800</pubDate><description><![CDATA[数论分块]]></description><category></category></item><item><title><![CDATA[2020江西省赛A 莫比乌斯反演]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127859919</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127859919</guid><author>stdforces</author><pubDate>Tue, 15 Nov 2022 09:42:00 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[洛谷P2520 裴蜀定理，多限制的不定方程解的构造]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127858235</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127858235</guid><author>stdforces</author><pubDate>Tue, 15 Nov 2022 00:06:44 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[牛牛P50591 解的分配问题，高精度组合数]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127842907</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127842907</guid><author>stdforces</author><pubDate>Mon, 14 Nov 2022 10:30:35 +0800</pubDate><description><![CDATA[组合数学，高精度]]></description><category></category></item><item><title><![CDATA[洛谷P2312 秦九韶算法求多项式点值]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127831808</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127831808</guid><author>stdforces</author><pubDate>Sun, 13 Nov 2022 14:24:56 +0800</pubDate><description><![CDATA[数论，秦九韶算法]]></description><category></category></item><item><title><![CDATA[洛谷P4598 解高次方程，数论]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127831390</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127831390</guid><author>stdforces</author><pubDate>Sun, 13 Nov 2022 13:50:11 +0800</pubDate><description><![CDATA[数论]]></description><category></category></item><item><title><![CDATA[牛客P15428 约数个数定理，暴力枚举，贪心剪枝]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127827465</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127827465</guid><author>stdforces</author><pubDate>Sun, 13 Nov 2022 00:01:14 +0800</pubDate><description><![CDATA[约数]]></description><category></category></item><item><title><![CDATA[牛客P19836 裴蜀定理+莫比乌斯反演+杜教筛]]></title><link>https://blog.youkuaiyun.com/stdforces/article/details/127827074</link><guid>https://blog.youkuaiyun.com/stdforces/article/details/127827074</guid><author>stdforces</author><pubDate>Sat, 12 Nov 2022 23:17:00 +0800</pubDate><description><![CDATA[裴蜀定理，莫比乌斯反演]]></description><category></category></item></channel></rss>