<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dcxa92155的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dcxa92155</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dcxa92155]]></copyright><item><title><![CDATA[[赛后总结]COCI2016/2017 Round#3题解]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105938</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105938</guid><author>dcxa92155</author><pubDate>Wed, 03 Jul 2019 09:52:00 +0800</pubDate><description><![CDATA[文章目录Imena题面描述输入输出分数分布题解实现Pohlepko题面描述输入输出分数分布题解实现Kronican题面描述输入输出分...]]></description><category></category></item><item><title><![CDATA[[赛后总结]COCI2016/2017 Round#1题解]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105936</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105936</guid><author>dcxa92155</author><pubDate>Tue, 25 Jun 2019 07:47:00 +0800</pubDate><description><![CDATA[文章目录Tarifa题面描述输入输出分数分布题解实现Jetpack题面描述输入输出分数分布题解实现Cezar题面描述输入输出分数分布...]]></description><category></category></item><item><title><![CDATA[[赛后总结]COCI2016/2017 Round#2题解]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105935</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105935</guid><author>dcxa92155</author><pubDate>Tue, 25 Jun 2019 07:47:00 +0800</pubDate><description><![CDATA[文章目录Go题面描述输出分数分布题解实现Tavan题面描述输入输出分数分布题解实现Nizin题目描述输入输出分数分布题解实现Pros...]]></description><category></category></item><item><title><![CDATA[[Atcoder NIKKEI Contest 2019]E.Weights on Vertices and Edges(并查集)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105937</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105937</guid><author>dcxa92155</author><pubDate>Thu, 28 Feb 2019 14:17:00 +0800</pubDate><description><![CDATA[即将退役前把之前咕掉的题解补上

题面
Score: 800800800 points
There is a connected ...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day4]负环(倍增)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105931</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105931</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:37:00 +0800</pubDate><description><![CDATA[题面

题解
卡常好题…
考场上乱搞了一个贪心居然骗到了95分。
考后和标程对拍了4000组数据才找出来哪里错了…
智商堪忧…
由于...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day1]三元组(Manacher+差分)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105933</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105933</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:36:00 +0800</pubDate><description><![CDATA[题面

题解
被题解坑到自闭系列…
不得不说能把一道这么简单的题写的如此好理解也是一种能力
明显首先需要Manacher，然后得到最...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day2]子串(AC自动机+高斯消元)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105932</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105932</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:36:00 +0800</pubDate><description><![CDATA[题面


题解
首先显然是一个AC自动机上DP的题目。
接下来是套路:
令dp[p]dp[p]dp[p]从AC自动机上的ppp点走到...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day4]最佳农场(二维卷积)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105930</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105930</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:36:00 +0800</pubDate><description><![CDATA[题面

样例输入

5 8
GLGGLGLG
GGLGGLGL
GGLLLGGG
LLGLLGLG
LGGGLGLL
3
2 3
G...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day3]欧铂瑞特(主席树/trie树)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105929</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105929</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:36:00 +0800</pubDate><description><![CDATA[题面

题解
比较巧妙的一道卡空间题。
首先注意到题目有查询kkk小，还支持在末尾添加和删除，就可以反应出来这是一道主席树的题目。
...]]></description><category></category></item><item><title><![CDATA[[2019寒假集训day2]子集(二分)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105928</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105928</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:36:00 +0800</pubDate><description><![CDATA[题面

题解
签到题。
首先可以证明的是，选出的子集大小一定是奇数个。
考虑先枚举中位数，因此可以排一下序。
设选的中位数位置为pp...]]></description><category></category></item><item><title><![CDATA[[Atcoder Yahoo Contest 2019]E.Odd Subrectangles(思维+线性基)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105927</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105927</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[Score : 800800800 points
题面
传送门
翻译有时间再补…
题解
很巧妙的一道题。
在此特别感谢一下Sovie...]]></description><category></category></item><item><title><![CDATA[[CF1089A]Alice the Fan(动态规划预处理)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105925</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105925</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[题面
传送门
题目描述
爱丽丝是排球的忠实粉丝，特别是非常强大的“A队”。
排球比赛最多由五局组成。 在每局比赛中，球队每赢一球得1...]]></description><category></category></item><item><title><![CDATA[[Atcoder Yahoo Contest 2019]D.Ears(动态规划)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105924</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105924</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[Score:600600600 points
题面
传送门
翻译有时间再补…
题解
体验感极差，考试的时候手残把1打成了2Debug...]]></description><category></category></item><item><title><![CDATA[[Atcoder Yahoo Contest 2019]F.Pass(动态规划+结论)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105923</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105923</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[Score : 900900900 points
题面
传送门
翻译有时间再补…
题解
Atcoder不缺少水题，只是你缺少了发现水...]]></description><category></category></item><item><title><![CDATA[[学习笔记]主席树经典例题]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105922</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105922</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[level 1
level 1-1 模板-查询k小值
模板，不再赘述。
#include&lt;iostream&gt;
#incl...]]></description><category></category></item><item><title><![CDATA[[Topcoder SRM 590]Fox And City(网络流建模)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105920</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105920</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[题面
问题描述：
一个国家有n个城市，编号为0~n-1。编号为0的城市是首都。该国的道路网形成无向连通图。换句话说：城市之间通过双向...]]></description><category></category></item><item><title><![CDATA[[JOI Open 2014 day1]Fortune Telling 2(线段树+二维数点)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105856</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105856</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:35:00 +0800</pubDate><description><![CDATA[题目




NNN张牌，每张牌有AAA、BBB面。AAA面的值为A[i]，BBB面的值为B[i]。初始AAA面朝上。
有KKK次操...]]></description><category></category></item><item><title><![CDATA[[BZOJ4543/3522][POI2014]Hotel加强版(长链剖分+树上DP)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105858</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105858</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:34:00 +0800</pubDate><description><![CDATA[题意简述
给出一棵 nnn 个点的无根树，请在这棵树上选三个互不相同的节点，使得这个三个节点两两之间距离相等，输出方案数即可。
su...]]></description><category></category></item><item><title><![CDATA[[2019赛前冲刺]考试技巧及模版(第二部分)]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105857</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105857</guid><author>dcxa92155</author><pubDate>Tue, 19 Feb 2019 17:34:00 +0800</pubDate><description><![CDATA[本博客是该模板的第二部分
注:由于编者太弱，以下知识可能仅仅只是给自己写的，对dalao没有任何参考价值，请谅解。

文章目录4....]]></description><category></category></item><item><title><![CDATA[[学习笔记]网络流/费用流总结]]></title><link>https://blog.youkuaiyun.com/dcxa92155/article/details/102105921</link><guid>https://blog.youkuaiyun.com/dcxa92155/article/details/102105921</guid><author>dcxa92155</author><pubDate>Sun, 06 Jan 2019 21:34:00 +0800</pubDate><description><![CDATA[这几天集中学习了一下有关网络流/费用流的问题。
自己之前也没有较为深入地研究过，只是打了几道板题然后就咕咕了。
[补]这篇博客本来...]]></description><category></category></item></channel></rss>