<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[yefuner的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/yefuner</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; yefuner]]></copyright><item><title><![CDATA[算法竞赛零散知识点记录]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/112400322</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/112400322</guid><author>yefuner</author><pubDate>Sat, 09 Jan 2021 19:17:25 +0800</pubDate><description><![CDATA[1.树上背包只枚举子树大小可以做到O(n2)复杂度，例如2020南京icpc M题

2.部分状压DP 可以通过按二进制下1的个数分组，和滚动数组的方式把空间复杂度从O(n*2^k)降到O(n*) 例如bzoj1097，claris的写法


]]></description><category></category></item><item><title><![CDATA[2020CCPC秦皇岛 k题 Kingdom’s Power（树上DP O(n) 复杂度）]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/109300464</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/109300464</guid><author>yefuner</author><pubDate>Mon, 26 Oct 2020 22:30:27 +0800</pubDate><description><![CDATA[发现网上都是o(nlogn)的写法，没有o(n)的，所以这里贴一下代码，简单讲解一下（感觉好像很难讲明白，我实在是太菜了QAQ）

显然如果派出一支军队访问子树，并回到子树根节点，那消耗的时间就是边长的2倍。首先，显然军队从根出发，经过一些路径后停留在叶子节点明显最优。考虑多引一支军队到达叶子节点，则该军队会先走过一段被其他军队走过的路径，会额外消耗一些时间。到达子树根节点后，子树根节点到某个叶子节点这段只用走一次，可以节省这段路径长度的时间。

dp[x]表示只考虑x节点所在的子树以及x指向父亲的那条边，]]></description><category></category></item><item><title><![CDATA[写题记录]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/103460716</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/103460716</guid><author>yefuner</author><pubDate>Mon, 09 Dec 2019 16:48:55 +0800</pubDate><description><![CDATA[2019/12/8 出校赛题（有两题无人ac，等ac了发题解）

2019/12/15 kpm200+了

1192 签到 1191 匈牙利 1143 最小点覆盖emmm这不是17南宁的m题么 果然要想过题还得多写题

1101 思路很奇特转换为相等1107 最长上升子序列乱搞 1108可以考虑下怎么确认有没有合法解 1109 要点在于根据推出的三个条件发现只需要其中两个能推出第三个（三维变二维...]]></description><category></category></item><item><title><![CDATA[2019dut周赛第二周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/103239283</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/103239283</guid><author>yefuner</author><pubDate>Mon, 25 Nov 2019 16:25:02 +0800</pubDate><description><![CDATA[本周不是出题人，这是作为参赛选手写的题解。

感谢出题人让我10个题的题解可以贴六个链接完成（还有一个签到都不需要写代码）



A签到 输出6.5

B写两个循环判一下


#include&lt;bits/stdc++.h&gt;
 
using namespace std;
char s1[10010],s2[10010];
    int p1,p2;  int len1,len2;
i...]]></description><category></category></item><item><title><![CDATA[2019dut周赛第一周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/103229003</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/103229003</guid><author>yefuner</author><pubDate>Sun, 24 Nov 2019 22:50:42 +0800</pubDate><description><![CDATA[A题



题解：



B题





题解：



C题

题意：



题解：

观察到n只有3 特判三种情况输出即可

D题





题解：

找题意遍历数组即可，如果wa是因为异或(^)运算符优先级比不等于(!=)低 给等式加上括号即可

E题



题解：

我们可以通过求每个耕地与离它最近的洒水器的距离的最小值，然后对所有耕地的最大值就可以得到k

先将洒水器和耕地的位...]]></description><category></category></item><item><title><![CDATA[2018大连理工大学程序设计竞赛暨蓝桥杯选拔赛题解报告]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/85255041</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/85255041</guid><author>yefuner</author><pubDate>Tue, 25 Dec 2018 23:00:02 +0800</pubDate><description><![CDATA[按难度排序大概是：A-F-D-I-G-B-L-C-H-J-K-E

目录

A：签到题1 数一数直接输出就行。

F：签到题2​

D：签到题3​

I：字符串处理​

G：bitset​

B：模拟​

L：逆元+DP​

C：矩阵快速幂​

H：带权并查集+manacher 或者暴力​

J：最短路​

K：拓扑排序​

E：树上差分​

A：签到题1 数一数直接输出就行。

F：签到题...]]></description><category></category></item><item><title><![CDATA[dut周赛第五周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/85105878</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/85105878</guid><author>yefuner</author><pubDate>Wed, 19 Dec 2018 19:49:52 +0800</pubDate><description><![CDATA[ 

Problem B: Amazing Number

Time Limit:3000/1000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:92   Accepted:19

[Submit][Status][Discuss]

Description

对于两个正整数N和M...]]></description><category></category></item><item><title><![CDATA[dut周赛第四周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/84727112</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/84727112</guid><author>yefuner</author><pubDate>Sun, 02 Dec 2018 20:17:04 +0800</pubDate><description><![CDATA[日常犯困ORZ写完D昏昏沉沉就去床上躺了 ，定了个四点的闹钟起来写了E，嘉庆大佬已经写博客了，那本周题解就直接留链接吧~

顺便说下E分块怎么卡过去：

Problem E: 一纸开卷

Time Limit:4000/2000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:23  ...]]></description><category></category></item><item><title><![CDATA[dut周赛第三周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/84501771</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/84501771</guid><author>yefuner</author><pubDate>Sun, 25 Nov 2018 20:35:18 +0800</pubDate><description><![CDATA[I E比较复杂不适合单人比赛，总体来说题目难度还可以，但是很多简单题大家没发现。

A：显然期望为平均值的和，没有坑点。

B：坑点在于a+b可能暴int所以要用longlong存

C：其实会写的话这题可以很短，具体看代码（YE5和N0也是坑点）

代码：


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int maxn=10...]]></description><category></category></item><item><title><![CDATA[dut周赛第二周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/84205470</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/84205470</guid><author>yefuner</author><pubDate>Sun, 18 Nov 2018 22:26:21 +0800</pubDate><description><![CDATA[ 

Problem E: So easy

Time Limit:3000/1000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)

Description

“iG牛逼, 登峰造极境!······“ GG同学仿佛还没有从月初iG夺冠的欢喜中醒过来,虽然还在睡梦中, 嘴里却不断的念叨着.不过, GG同学的梦没有做多久...]]></description><category></category></item><item><title><![CDATA[dut周赛第一周]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/83986231</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/83986231</guid><author>yefuner</author><pubDate>Mon, 12 Nov 2018 09:17:59 +0800</pubDate><description><![CDATA[没午睡头昏脑胀把能踩的坑都踩了....签到题都没写完（读题和代码能力一直是短板ORZ）

EFG比较水，有人有需求再添加，这里只给代码。J（已补） SG函数还不会...得找个时间学（潼神每次都出SG函数 蓝瘦）。

 

E：判断C的情况  大于10000遍历c的倍数  ，小于10000因为 位数平方和最多9*81  所以遍历c*81*9


    	    			
    #include&amp;l...]]></description><category></category></item><item><title><![CDATA[DUToj1228: Pokémon battle（极大极小值搜索）]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/82179563</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/82179563</guid><author>yefuner</author><pubDate>Wed, 29 Aug 2018 10:51:37 +0800</pubDate><description><![CDATA[1228: Pokémon battle

Time Limit:6000/4000 MS (Java/Others)   Memory Limit:294912/262144 KB (Java/Others)
Total Submissions:14   Accepted:6

[Submit][Status][Discuss]

Description



有一天大哥和老仙觉得暴雪游戏都太S...]]></description><category></category></item><item><title><![CDATA[2018大连理工新生赛解题报告]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/82155756</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/82155756</guid><author>yefuner</author><pubDate>Tue, 28 Aug 2018 23:01:49 +0800</pubDate><description><![CDATA[Problem A: 打ACM真开心啊！

思路：假装没有这一题

roblem B: Zeratul与翻转黑白棋

思路：皮这一下很开心=W=！

Problem C: Type-B型时间芯片

思路：算一下 数量然后就输出……

代码：


    #include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
int n;
int dx[5]={0,1,...]]></description><category></category></item><item><title><![CDATA[DUToj1220: Minitrue volunteer(DP kmp)]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/82155341</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/82155341</guid><author>yefuner</author><pubDate>Tue, 28 Aug 2018 22:03:19 +0800</pubDate><description><![CDATA[1220: Minitrue volunteer

Time Limit:10000/8000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:18   Accepted:2

[Submit][Status][Discuss]

Description

净化网络环境是每一个新时代青...]]></description><category></category></item><item><title><![CDATA[DUToj1222: Big brother said the calculation（二分查找 线段树）]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/82152324</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/82152324</guid><author>yefuner</author><pubDate>Tue, 28 Aug 2018 18:23:31 +0800</pubDate><description><![CDATA[1222: Big brother said the calculation

Time Limit:27000/25000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:44   Accepted:5

[Submit][Status][Discuss]

Description
...]]></description><category></category></item><item><title><![CDATA[DUToj1223: Professional commentator of a stupid game(树状数组)]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/81865770</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/81865770</guid><author>yefuner</author><pubDate>Mon, 20 Aug 2018 09:47:11 +0800</pubDate><description><![CDATA[1223: Professional commentator of a stupid game

Time Limit:5000/3000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:46   Accepted:5

[Submit][Status][Discuss]

Descr...]]></description><category></category></item><item><title><![CDATA[DUToj1221 A quest with no intelligence（欧拉回路）]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/81865422</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/81865422</guid><author>yefuner</author><pubDate>Mon, 20 Aug 2018 09:13:07 +0800</pubDate><description><![CDATA[1221: A quest with no intelligence

Time Limit:3000/1000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)  Special Judge
Total Submissions:36   Accepted:8

[Submit][Status][Discuss]

Des...]]></description><category></category></item><item><title><![CDATA[DUToj1085 Water Problem(矩阵快速幂)]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/80917179</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/80917179</guid><author>yefuner</author><pubDate>Wed, 04 Jul 2018 20:03:50 +0800</pubDate><description><![CDATA[ 

Problem I: Water Problem

Time Limit:3000/1000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)
Total Submissions:1405   Accepted:154

[Submit][Status][Discuss]

Description

函数 f:Z+→...]]></description><category></category></item><item><title><![CDATA[DUToj1031 大九神的难题]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/80888646</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/80888646</guid><author>yefuner</author><pubDate>Mon, 02 Jul 2018 19:14:10 +0800</pubDate><description><![CDATA[1031: 大九神的难题Time Limit:3000/1000 MS (Java/Others)   Memory Limit:163840/131072 KB (Java/Others)Total Submissions:51   Accepted:14[Submit][Status][Discuss]Description大九神是ACM组一位传奇人物。在网络赛现场赛中屡立奇功。什么爆搜过XX...]]></description><category></category></item><item><title><![CDATA[DUTOJ1207: Donuts!!!（）]]></title><link>https://blog.youkuaiyun.com/yefuner/article/details/80085658</link><guid>https://blog.youkuaiyun.com/yefuner/article/details/80085658</guid><author>yefuner</author><pubDate>Wed, 25 Apr 2018 21:06:09 +0800</pubDate><description><![CDATA[1207: Donuts!!!

Time Limit:5000/3000 MS (Java/Others)   Memory Limit:294912/262144 KB (Java/Others)
Total Submissions:204   Accepted:30

[Submit][Status][Discuss]

Description

Shinobu酷爱吃Mr. Donuts品牌...]]></description><category></category></item></channel></rss>