<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Averyta的博客]]></title><description><![CDATA[an oier in the cruel world]]></description><link>https://blog.youkuaiyun.com/AngryVegetable</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AngryVegetable]]></copyright><item><title><![CDATA[学习笔记 | 反演 | 二项式反演 | 莫比乌斯反演 | 狄利克雷卷积 |容斥 | 未完待更 | 在更]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/99183797</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/99183797</guid><author>AngryVegetable</author><pubDate>Sun, 11 Aug 2019 13:28:51 +0800</pubDate><description><![CDATA[文章目录学习笔记 | 反演 | 二项式反演 | 莫比乌斯反演 | 狄利克雷卷积 |容斥参考资料。前言引入简单的容斥应用-全错排幕后反演的定义莫比乌斯反演！
学习笔记 | 反演 | 二项式反演 | 莫比乌斯反演 | 狄利克雷卷积 |容斥

参考资料。
炫酷反演魔术-vfleaking
莫比乌斯反演-PoPoQQQ
【数论】积性函数、莫比乌斯反演、狄利克雷卷积-nanoape
如何证明莫比乌斯反演
前...]]></description><category></category></item><item><title><![CDATA[论逗逼的自我修养之常犯逗逼错误 | 在更]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/99087646</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/99087646</guid><author>AngryVegetable</author><pubDate>Sat, 10 Aug 2019 17:43:11 +0800</pubDate><description><![CDATA[在set里面找小于xxx的最大的数

用lower_bound()如果返回end()的话并不一定是不存在




]]></description><category></category></item><item><title><![CDATA[一些题解的传送门qwq]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838716</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838716</guid><author>AngryVegetable</author><pubDate>Tue, 06 Aug 2019 15:44:26 +0800</pubDate><description><![CDATA[Codeforces
Codeforces293

]]></description><category></category></item><item><title><![CDATA[AtCoder | ARC064 | 题解]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/98622868</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/98622868</guid><author>AngryVegetable</author><pubDate>Tue, 06 Aug 2019 15:35:33 +0800</pubDate><description><![CDATA[ARC064
感觉这场还是挺简单的（但这并不影响我仍然不会做QwQ
EEE题感觉啥都想到了。…知道要去求最短路…但却没有想到dij…???(smg
C. Boxes and Candies
肯定是尽量改[2,n−1][2,n-1][2,n−1]的嘛…所以你就一遍扫下来就行啦呀
#include &lt;bits/stdc++.h&gt;
#define ll long long
using nam...]]></description><category></category></item><item><title><![CDATA[算法 | 动态dp学习笔记 | 未完待更]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/98621477</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/98621477</guid><author>AngryVegetable</author><pubDate>Tue, 06 Aug 2019 15:23:29 +0800</pubDate><description><![CDATA[动态dp学习笔记]]></description><category></category></item><item><title><![CDATA[一些常用的网站]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/98588032</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/98588032</guid><author>AngryVegetable</author><pubDate>Tue, 06 Aug 2019 09:40:09 +0800</pubDate><description><![CDATA[码数学公式必备-markdown！
丢博客
∈\in∈ {}\{\}{}
树图转换网站
实现树图图像展示…你值得拥有啦~
画图网站
小清新画图网站～

]]></description><category></category></item><item><title><![CDATA[一些很重要但是往往想不到的小套路 + 常用小技巧 | 持续更新中...]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/98520283</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/98520283</guid><author>AngryVegetable</author><pubDate>Mon, 05 Aug 2019 21:16:29 +0800</pubDate><description><![CDATA[前言
一篇很正经的博客…qwq


网格问题可以考虑行列是否满足可交换性质


方案数或者说个数难以计算的时候可以考虑转换为概率

ZJOI2019线段树
ZJOI2019MinMax搜索



dp转移可以考虑将系数进行前缀和或者矩阵优化

Codeforces1151F - Sonya and Informatics



本质不同的回文串只会有nnn个



...]]></description><category></category></item><item><title><![CDATA[算法 | 关于MST的几个经典问题 | 未完待补]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/98481305</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/98481305</guid><author>AngryVegetable</author><pubDate>Mon, 05 Aug 2019 11:29:36 +0800</pubDate><description><![CDATA[文章目录关于MST的几个问题Codeforces160 D.Edges in MSTCodeforces1108 F.MST UnificationCodeforces827 D.Best Edge Weight
关于MST的几个问题
反正关于这种最小生成树的题目来一道不会一道…不要跟我提什么电话连线这种很裸很裸的题
这里介绍一下用MST性质的几道题目
Codeforces160 D.Edges ...]]></description><category></category></item><item><title><![CDATA[Codeforces | Round #576 Div2 |1199E, 1199F 题解]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/97866190</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/97866190</guid><author>AngryVegetable</author><pubDate>Wed, 31 Jul 2019 04:58:33 +0800</pubDate><description><![CDATA[Codeforces 1199 - E. Matching vs Independe Set
题意
有一张3∗n3*n3∗n个点mmm条边的无向图…问你是否能够选出nnn个点的独立集或者是nnn条边的独立集
并且输出方案
1≤n≤1e5,1≤m≤5e51 \leq n \leq 1e5,1 \leq m \leq 5e51≤n≤1e5,1≤m≤5e5
题解
真的是学傻了满脑子仙人掌最大独立集还有圆...]]></description><category></category></item><item><title><![CDATA[Gym - 101630 部分题解 | 待咕]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/97612394</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/97612394</guid><author>AngryVegetable</author><pubDate>Sun, 28 Jul 2019 11:07:07 +0800</pubDate><description><![CDATA[有几题没补..但感觉这些题目都是不错的..所以..会抽时间补一下的吧？？？]]></description><category></category></item><item><title><![CDATA[杂想？?]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/97496896</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/97496896</guid><author>AngryVegetable</author><pubDate>Sat, 27 Jul 2019 11:21:58 +0800</pubDate><description><![CDATA[人难免天生有自怜的情绪，唯有时刻保持清醒，才能看清真正的价值在哪里。]]></description><category></category></item><item><title><![CDATA[题解 | 杂题]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/97487629</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/97487629</guid><author>AngryVegetable</author><pubDate>Sat, 27 Jul 2019 09:35:08 +0800</pubDate><description><![CDATA[不知道写点啥了...就随便写写了..]]></description><category></category></item><item><title><![CDATA[算法 | 字符串模版总结? | 持续更新中...]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/97376174</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/97376174</guid><author>AngryVegetable</author><pubDate>Fri, 26 Jul 2019 11:33:38 +0800</pubDate><description><![CDATA[网上的优秀博文有很多…这篇主要是用来让博主尽快回忆起来并会写代码用的qwq
problems are welcome!]]></description><category></category></item><item><title><![CDATA[算法学习笔记汇总]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838562</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838562</guid><author>AngryVegetable</author><pubDate>Mon, 22 Jul 2019 11:06:18 +0800</pubDate><description><![CDATA[讲道理我真的没有写过什么学习笔记…
虚树

]]></description><category></category></item><item><title><![CDATA[算法 | 虚树学习笔记]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838201</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/96838201</guid><author>AngryVegetable</author><pubDate>Mon, 22 Jul 2019 11:00:53 +0800</pubDate><description><![CDATA[虚树学习笔记]]></description><category></category></item><item><title><![CDATA[Codeforces293 | Round#174 Div1| 题解报告]]></title><link>https://blog.youkuaiyun.com/AngryVegetable/article/details/96745412</link><guid>https://blog.youkuaiyun.com/AngryVegetable/article/details/96745412</guid><author>AngryVegetable</author><pubDate>Sun, 21 Jul 2019 18:37:27 +0800</pubDate><description><![CDATA[我也不知道该说啥了...被自己蠢哭了哇....]]></description><category></category></item></channel></rss>