<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JP_f 's blog]]></title><description><![CDATA[Welcome to my wonderland !]]></description><link>https://blog.youkuaiyun.com/JessiePan_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JessiePan_]]></copyright><item><title><![CDATA[2023牛客寒假算法基础集训营1.题解]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128725101</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128725101</guid><author>JessiePan_</author><pubDate>Fri, 20 Jan 2023 11:14:12 +0800</pubDate><description><![CDATA[2023牛客寒假算法基础集训营1.题解]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 141 (Rated for Div. 2).题解]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128740480</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128740480</guid><author>JessiePan_</author><pubDate>Fri, 20 Jan 2023 11:05:28 +0800</pubDate><description><![CDATA[Educational Codeforces Round 141 (Rated for Div. 2)]]></description><category></category></item><item><title><![CDATA[STL.模板]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128732640</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128732640</guid><author>JessiePan_</author><pubDate>Thu, 19 Jan 2023 10:50:57 +0800</pubDate><description><![CDATA[STL.模板]]></description><category></category></item><item><title><![CDATA[Codeforces Round #843 (Div. 2).题解]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128651341</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128651341</guid><author>JessiePan_</author><pubDate>Fri, 13 Jan 2023 21:24:15 +0800</pubDate><description><![CDATA[Codeforces Round #843 (Div. 2).题解]]></description><category></category></item><item><title><![CDATA[第46屆ICPC 東亞洲區域賽（澳門）(正式賽）.题解]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128679777</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128679777</guid><author>JessiePan_</author><pubDate>Fri, 13 Jan 2023 21:21:46 +0800</pubDate><description><![CDATA[第46屆ICPC 東亞洲區域賽（澳門）(正式賽）.题解]]></description><category></category></item><item><title><![CDATA[The 2021 ICPC Asia Shanghai Regional Programming Contest.题解]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/128633225</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/128633225</guid><author>JessiePan_</author><pubDate>Tue, 10 Jan 2023 17:13:08 +0800</pubDate><description><![CDATA[The 2021 ICPC Asia Shanghai Regional Programming Contest.题解]]></description><category></category></item><item><title><![CDATA[栈stack]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/125597013</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/125597013</guid><author>JessiePan_</author><pubDate>Mon, 04 Jul 2022 11:42:11 +0800</pubDate><description><![CDATA[栈]]></description><category></category></item><item><title><![CDATA[P1032 [NOIP2002 提高组] 字串变换（洛谷)]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/124667768</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/124667768</guid><author>JessiePan_</author><pubDate>Mon, 09 May 2022 17:38:13 +0800</pubDate><description><![CDATA[bfs:
经典 二重for循环：
1格子（字符串）8方向（选择)
while(!q.empty())
queue遍历
priority_queue优先级
void bfs() {
    int ans = 0;
    node u, v; u.str = s, u.step = 0;
    q.push(u);
    while (!q.empty()) {
        u = q.front(); q.pop();
        if (maps.count(u.str)) continue]]></description><category></category></item><item><title><![CDATA[P3375 【模板】KMP字符串匹配（洛谷）]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/124604827</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/124604827</guid><author>JessiePan_</author><pubDate>Fri, 06 May 2022 12:19:57 +0800</pubDate><description><![CDATA[P3375 【模板】KMP字符串匹配
理解
一.求长度
string类型：
string s;
(1) s.length()
(2)s.size()
char类型：
char s[100];
(1)strlen(s)
(2)sizeof(s) : ‘\0’
二.KMP
模式匹配/字符串匹配
模式串/子串自配 = prefix( &amp; suffix) table




i
0 1 2 3 4 5




1/2
_ a b a b c


for (int i = 2, j = 0; i &lt;= ]]></description><category></category></item><item><title><![CDATA[P3956 [NOIP2017 普及组] 棋盘]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/124576327</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/124576327</guid><author>JessiePan_</author><pubDate>Wed, 04 May 2022 20:56:04 +0800</pubDate><description><![CDATA[P3956 [NOIP2017 普及组] 棋盘
理解
read() 快读函数：
（1）强类型语言C++   =&gt;  泛型汇编
template &lt;typename Tp&gt;
void read(Tp &amp;x)
（2）&amp;x 引用：实参 =&gt; 形参
actual parameter
（3）getchar() ：遇 ’\n’ 止步
template &lt;typename Tp&gt;
void read(Tp &amp;x) {
    x = 0; int f = 1; ]]></description><category></category></item><item><title><![CDATA[P1443 马的遍历（洛谷）]]></title><link>https://blog.youkuaiyun.com/JessiePan_/article/details/124524851</link><guid>https://blog.youkuaiyun.com/JessiePan_/article/details/124524851</guid><author>JessiePan_</author><pubDate>Sun, 01 May 2022 12:23:58 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

文章目录P1443 马的遍历一、Question二、MY CODE2.读入数据总结

P1443 马的遍历

（1）BFS（breadth first search） 2）Queue

一、Question
题目描述
有一个 n \times mn×m 的棋盘，在某个点 (x, y)(x,y) 上有一个马，要求你计算出马到达棋盘上任意一个点最少要走几步。
输入格式
输入只有一行四个整数，分别为 n, m, x, yn,m,x,y。
输出格.]]></description><category></category></item></channel></rss>