<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Perfect_Life_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Perfect_Life_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Perfect_Life_]]></copyright><item><title><![CDATA[明明有网，但是某些页面就是打不开，显示无法访问]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142585544</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142585544</guid><author>Perfect_Life_</author><pubDate>Fri, 27 Sep 2024 09:43:19 +0800</pubDate><description><![CDATA[解决方法：更改适配器设置——自动获得IP地址；自动获得DNS服务器地址。]]></description><category></category></item><item><title><![CDATA[2024ICPC网络赛第一场 —— G. The Median of the Median of the Median （中位数二分+前缀和）]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142310759</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142310759</guid><author>Perfect_Life_</author><pubDate>Tue, 17 Sep 2024 09:09:27 +0800</pubDate><description><![CDATA[先通过A数组求B数组，再通过B数组求C数组中<=mid的数量。若<=mid的数量 >= 中位数的定义数量，则中位数一定<=mid，r=mid。还是这个例子，那么首先将A数组<=mid的元素赋为1，反之为0。若A数组是 1 3 1 7 ， 假设此时二分的mid = 1。对A做前缀和 1 1 2 2 ，即可n方求出B数组。，只需要知道C数组某个数是否<=mid即可。但因为我们要求的是<=mid的数量，所以。反之，中位数一定>mid，l=mid。C数组中<=mid的数量即为7。A数组即为 1 0 1 0。]]></description><category></category></item><item><title><![CDATA[2024牛客暑期多校训练营3 —— J Rigged Games]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142281708</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/142281708</guid><author>Perfect_Life_</author><pubDate>Sun, 15 Sep 2024 11:12:47 +0800</pubDate><description><![CDATA[倍增的写法非常固定，1.预处理 2.查询。]]></description><category></category></item><item><title><![CDATA[Windows选择其他应用打开出现乱码解决方式]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141609487</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141609487</guid><author>Perfect_Life_</author><pubDate>Tue, 27 Aug 2024 18:27:20 +0800</pubDate><description><![CDATA[原因：该文件路径下的软件已被删除，而注册表中将会残留着在安装或使用此软件时生成的注册信息。2.ctrl+F搜索乱码信息如：“D:\Firefox\firefox.exe”一直不断查找下一个，然后将其全部删除即可（如果还有一定是你没删完）1. win+R打开运行，输入regedit打开注册表。解决：清理注册表信息。]]></description><category></category></item><item><title><![CDATA[2024杭电多校第一场 —— 1005 博弈]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141527812</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141527812</guid><author>Perfect_Life_</author><pubDate>Sun, 25 Aug 2024 12:22:19 +0800</pubDate><description><![CDATA[【代码】2024杭电多校第一场 —— 1005 博弈。]]></description><category></category></item><item><title><![CDATA[2024杭电多校第一场 —— 1003 树]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141503167</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141503167</guid><author>Perfect_Life_</author><pubDate>Sat, 24 Aug 2024 18:37:11 +0800</pubDate><description><![CDATA[前置知识：树上启发式合并 dsu on tree（建议OI-WiKi上学习）开三个树状数组分别维护前缀和、平方和、数量即可。]]></description><category></category></item><item><title><![CDATA[2024杭电多校第七场 —— 1008循环图]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141370949</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/141370949</guid><author>Perfect_Life_</author><pubDate>Tue, 20 Aug 2024 23:45:10 +0800</pubDate><description><![CDATA[dp[i]表示到点i的方案数，A[i]表示到第i层的点A的方案数，A[i]=层间转移数*层内转移数。关键点2：又考虑到每层的DP转移只与上一层节点有关，且转移是线性的，考虑矩阵快速幂优化。关键点1：v[i] >= u[i]+1 则说明一定为拓扑图。时间复杂度O(n^3*log(1e18))前置知识：矩阵快速幂（自行优快云），若没有边权才可用加法(相当于乘1)tag:图论+DP+矩阵快速幂优化。]]></description><category></category></item><item><title><![CDATA[2024杭电多校第三场 —— 1008比特跳跃]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/140724312</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/140724312</guid><author>Perfect_Life_</author><pubDate>Fri, 26 Jul 2024 20:42:49 +0800</pubDate><description><![CDATA[证明：假设使用两次比特跳跃，a->b,c->d，那么权值为 k*(a|b+c|d) ，不如直接从a->d，权值为 k*(a|d)，因为a|b+c|d >= min(a,b)+min(c,d)>=a+b>=a|d。反证法：若 x|y!= y，则从1跳到y一定比从x跳到y更优。且比特跳跃若从x跳到y一定满足 x|y=y，或者是从1跳到y。由题意可知从点1到点n的最短路径最多使用1次比特跳跃。枚举子集时间复杂度O(2^n) n为二进制的位数。tag:最短路径+枚举子集。]]></description><category></category></item><item><title><![CDATA[2024牛客暑期多校训练营4 —— J Zero]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/140697621</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/140697621</guid><author>Perfect_Life_</author><pubDate>Thu, 25 Jul 2024 19:06:01 +0800</pubDate><description><![CDATA[dp[i][j]表示以i为结尾，前面有len个1，对答案的贡献。tag：二项式化简+dp。]]></description><category></category></item><item><title><![CDATA[PAT天梯赛刷题记录(更新中~只记录有思考价值的题)]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/137817525</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/137817525</guid><author>Perfect_Life_</author><pubDate>Tue, 16 Apr 2024 11:11:52 +0800</pubDate><description><![CDATA[01背包（先用大物品再用小物品）+输出路径。树状数组+二分（求第k小）离散化+优先队列+拓扑排序。树状数组求树上逆序对。]]></description><category></category></item><item><title><![CDATA[牛客小白G-小苯的逆序对（树状数组+DP/莫比乌斯函数）]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136142541</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136142541</guid><author>Perfect_Life_</author><pubDate>Wed, 21 Feb 2024 02:04:12 +0800</pubDate><description><![CDATA[则ans=gcd[1]+gcd[2]+gcd[3]-gcd[6].... = mobius[i]*gcd[i] (gcd[i]表示是i的倍数的逆序对个数)求出gcd(ai, aj)是1的倍数的逆序对个数，gcd(ai, aj)是2的倍数.... 是n的倍数。时间复杂度均为 O(nlognlogn)]]></description><category></category></item><item><title><![CDATA[2024牛客寒假算法基础集训营4【难题详解】]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136200871</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136200871</guid><author>Perfect_Life_</author><pubDate>Wed, 21 Feb 2024 01:27:30 +0800</pubDate><description><![CDATA[只写if(mx[i][j-1][2]!因为if判断为false的话， mx[i][j-1][3] 这个状态就不会被考虑。mx[j][7]表示，在当前遍历的 i~j 中所满足的最大值。mx[i][j][1]=表示选了式子中的第一个数b1。状态转移：按选或不选第j个数划分。]]></description><category></category></item><item><title><![CDATA[2024牛客寒假算法基础集训营3【难题详解】]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136123638</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136123638</guid><author>Perfect_Life_</author><pubDate>Thu, 15 Feb 2024 22:32:31 +0800</pubDate><description><![CDATA[【代码】2024牛客寒假算法基础集训营3【难题详解】]]></description><category></category></item><item><title><![CDATA[2024牛客寒假算法基础集训营2【难题详解】]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136112805</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136112805</guid><author>Perfect_Life_</author><pubDate>Wed, 14 Feb 2024 18:27:22 +0800</pubDate><description><![CDATA[题意：将物品移动n-k步的最小价值，移动ai步需要花费bi (若>=n则%n)此题不能用单调队列优化，因为取模的关系，导致状态转移没有单调性。]]></description><category></category></item><item><title><![CDATA[2024牛客寒假算法基础集训营1【难题详解】]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136002903</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/136002903</guid><author>Perfect_Life_</author><pubDate>Sat, 03 Feb 2024 00:08:07 +0800</pubDate><description><![CDATA[dp[j]表示：满足m的二进制表示下第j位为1，且背包的体积=m-(1]]></description><category></category></item><item><title><![CDATA[PAT甲级刷题记录(更新中~只记录有思考价值的题)]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/135833398</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/135833398</guid><author>Perfect_Life_</author><pubDate>Wed, 24 Jan 2024 22:52:01 +0800</pubDate><description><![CDATA[PAT甲级刷题记录(更新中~只记录有思考价值的题)，想练甲级的只刷这些题就完全可以，少刷水题。]]></description><category></category></item><item><title><![CDATA[二分图的最大匹配——匈牙利算法（追女孩大法，非常生动形象！！！）]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/127934433</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/127934433</guid><author>Perfect_Life_</author><pubDate>Sat, 19 Nov 2022 11:21:36 +0800</pubDate><description><![CDATA[匈牙利算法求解二分图的最大匹配问题]]></description><category></category></item><item><title><![CDATA[Vim常用命令（小白入门必备）]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/127823604</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/127823604</guid><author>Perfect_Life_</author><pubDate>Sat, 12 Nov 2022 18:37:25 +0800</pubDate><description><![CDATA[Vim常用命令，小白入门必备]]></description><category></category></item><item><title><![CDATA[long long int与long long的区别]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/125830614</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/125830614</guid><author>Perfect_Life_</author><pubDate>Sun, 17 Jul 2022 12:46:34 +0800</pubDate><description><![CDATA[long long int 与 long long 用法完全一致（原因在于:)]]></description><category></category></item><item><title><![CDATA[子函数中malloc分配内存]]></title><link>https://blog.youkuaiyun.com/Perfect_Life_/article/details/122813906</link><guid>https://blog.youkuaiyun.com/Perfect_Life_/article/details/122813906</guid><author>Perfect_Life_</author><pubDate>Mon, 07 Feb 2022 19:57:53 +0800</pubDate><description><![CDATA[malloc创建的存储空间不会随着子函数的结束而释放，而需要通过free释放。


]]></description><category></category></item></channel></rss>