<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_60109861的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_60109861</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_60109861]]></copyright><item><title><![CDATA[杭电多校＜八＞树形DP]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126291804</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126291804</guid><author>qq_60109861</author><pubDate>Fri, 12 Aug 2022 10:17:18 +0800</pubDate><description><![CDATA[杭电多校树形DP。]]></description><category></category></item><item><title><![CDATA[杭电多校＜七＞思维&博弈论&树图]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126254963</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126254963</guid><author>qq_60109861</author><pubDate>Wed, 10 Aug 2022 11:32:25 +0800</pubDate><description><![CDATA[电多校思维&博弈论&树图。]]></description><category></category></item><item><title><![CDATA[暑期留校-博弈论 NIM && SG函数例题]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126261982</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126261982</guid><author>qq_60109861</author><pubDate>Wed, 10 Aug 2022 10:52:22 +0800</pubDate><description><![CDATA[暑期留校-博弈论 NIM && SG函数例题。]]></description><category></category></item><item><title><![CDATA[暑期留校-图论-字典序最小欧拉路]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126201071</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126201071</guid><author>qq_60109861</author><pubDate>Mon, 08 Aug 2022 11:16:59 +0800</pubDate><description><![CDATA[欧拉路基础题。]]></description><category></category></item><item><title><![CDATA[拓扑排序的相关应用]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126195517</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126195517</guid><author>qq_60109861</author><pubDate>Sat, 06 Aug 2022 20:11:27 +0800</pubDate><description><![CDATA[拓扑排序的相关应用。]]></description><category></category></item><item><title><![CDATA[判断图中是否有环]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126174153</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126174153</guid><author>qq_60109861</author><pubDate>Sat, 06 Aug 2022 15:11:51 +0800</pubDate><description><![CDATA[判断图中是否有环。]]></description><category></category></item><item><title><![CDATA[杭电多校＜六＞子树&字符串]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126165910</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126165910</guid><author>qq_60109861</author><pubDate>Thu, 04 Aug 2022 20:57:57 +0800</pubDate><description><![CDATA[给你一棵有根的树，由编号从1到n的n个顶点组成，根是顶点1。定义bu = MEX{x|∃v∈子树（u），x = av}。不幸的是，没有给出ai。请找出最大可能的P ni=1 bi。第一行包含一个整数T（1≤T≤10），表示测试案例的数量。一个集合的MEX是不属于该集合的最小非负整数。，而且没有两个不同的顶点具有相同的权重。顶点i有一个自然数权重ai。第一行包含一个整数n。...]]></description><category></category></item><item><title><![CDATA[杭电多校＜五＞ set & 树的深度 & 树上建边]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126129610</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126129610</guid><author>qq_60109861</author><pubDate>Wed, 03 Aug 2022 16:49:50 +0800</pubDate><description><![CDATA[杭电五]]></description><category></category></item><item><title><![CDATA[暑期留校——树形DP入门题-没有上司的舞会]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126074975</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126074975</guid><author>qq_60109861</author><pubDate>Sat, 30 Jul 2022 17:16:15 +0800</pubDate><description><![CDATA[暑期留校——树形DP入门题-没有上司的舞会。]]></description><category></category></item><item><title><![CDATA[暑期留校——状压DP-板子题-最短Hamilton路径]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126073033</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126073033</guid><author>qq_60109861</author><pubDate>Sat, 30 Jul 2022 16:18:03 +0800</pubDate><description><![CDATA[期留校——状压DP-板子题-最短Hamilton路径。]]></description><category></category></item><item><title><![CDATA[暑期留校——状态压缩DP-板子题]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126059976</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126059976</guid><author>qq_60109861</author><pubDate>Fri, 29 Jul 2022 22:05:09 +0800</pubDate><description><![CDATA[暑期留校——状态压缩DP-板子题。]]></description><category></category></item><item><title><![CDATA[暑期留校——计数DP-n的组合数问题]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126054952</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126054952</guid><author>qq_60109861</author><pubDate>Fri, 29 Jul 2022 16:57:16 +0800</pubDate><description><![CDATA[f[i][j]表示只从1~i中选，且总和等于j的方案数。f[i][j]表示总和为i，总个数为j的方案数。]]></description><category></category></item><item><title><![CDATA[杭电多校（三）思维+贪心]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126043083</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126043083</guid><author>qq_60109861</author><pubDate>Thu, 28 Jul 2022 21:48:27 +0800</pubDate><description><![CDATA[假设你选了i个快递，你最后选择送出的时间肯定是这i个里面r最小的。然后用一个set维护一下在a[j].r还能拿多少。]]></description><category></category></item><item><title><![CDATA[暑期留校——区间DP-板子题石子合并]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/126023106</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/126023106</guid><author>qq_60109861</author><pubDate>Wed, 27 Jul 2022 21:00:26 +0800</pubDate><description><![CDATA[暑期留校——区间DP-板子题石子合并。]]></description><category></category></item><item><title><![CDATA[杭电多校（二）思维逻辑]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125939243</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125939243</guid><author>qq_60109861</author><pubDate>Tue, 26 Jul 2022 19:48:34 +0800</pubDate><description><![CDATA[这题的关键是要理解7*i+31*j从365开始没个值都有对应的。这题没有看懂题意，后面知道了所有的顺序都要自己来排一遍。]]></description><category></category></item><item><title><![CDATA[杭电多校(一) 快速幂&逆元&博弈]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125893967</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125893967</guid><author>qq_60109861</author><pubDate>Tue, 26 Jul 2022 19:12:49 +0800</pubDate><description><![CDATA[杭电第一场]]></description><category></category></item><item><title><![CDATA[暑期留校——图论-欧拉路径&回路&拓扑排序]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125971824</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125971824</guid><author>qq_60109861</author><pubDate>Tue, 26 Jul 2022 19:08:03 +0800</pubDate><description><![CDATA[暑期留校——图论-欧拉路径&回路&拓扑排序。]]></description><category></category></item><item><title><![CDATA[暑期留校——数据结构-树状数组经典板子题]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125953138</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125953138</guid><author>qq_60109861</author><pubDate>Sat, 23 Jul 2022 21:40:05 +0800</pubDate><description><![CDATA[树状数组]]></description><category></category></item><item><title><![CDATA[暑期留校——二分图-染色 + 二分]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125947869</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125947869</guid><author>qq_60109861</author><pubDate>Sat, 23 Jul 2022 15:05:34 +0800</pubDate><description><![CDATA[暑期留校——二分图-染色+二分。]]></description><category></category></item><item><title><![CDATA[暑期留校——图论-染色法判定二分图&二分图的最大匹配]]></title><link>https://blog.youkuaiyun.com/qq_60109861/article/details/125888681</link><guid>https://blog.youkuaiyun.com/qq_60109861/article/details/125888681</guid><author>qq_60109861</author><pubDate>Wed, 20 Jul 2022 15:39:05 +0800</pubDate><description><![CDATA[暑期留校——图论-染色法判定二分图&二分图的最大匹配。]]></description><category></category></item></channel></rss>