<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.cvbbacm.com/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.cvbbacm.com/feed.php">
        <title>CVBB ACM Team 2020-2021:teams:no_morning_training</title>
        <description></description>
        <link>https://wiki.cvbbacm.com/</link>
        <image rdf:resource="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico" />
       <dc:date>2026-04-29T23:32:24+0800</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E5%9B%BE%E7%9A%84%E5%A4%9A%E7%A7%8D%E5%AD%98%E5%82%A8%E6%96%B9%E6%B3%95&amp;rev=1589702211&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E5%8F%8A%E5%85%B6%E4%BC%98%E5%8C%96&amp;rev=1590156969&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E8%AE%A1%E7%AE%97&amp;rev=1591011124&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:a_%E7%AE%97%E6%B3%95&amp;rev=1590758920&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:fayuanyu&amp;rev=1596185471&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:front_page&amp;rev=1589118021&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:nomansland&amp;rev=1590758218&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:shaco&amp;rev=1597919793&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record&amp;rev=1590573107&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week1&amp;rev=1591342064&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week2&amp;rev=1589646007&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:weekly&amp;rev=1599056372&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico">
        <title>CVBB ACM Team</title>
        <link>https://wiki.cvbbacm.com/</link>
        <url>https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico</url>
    </image>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E5%9B%BE%E7%9A%84%E5%A4%9A%E7%A7%8D%E5%AD%98%E5%82%A8%E6%96%B9%E6%B3%95&amp;rev=1589702211&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-17T15:56:51+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:图的多种存储方法</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E5%9B%BE%E7%9A%84%E5%A4%9A%E7%A7%8D%E5%AD%98%E5%82%A8%E6%96%B9%E6%B3%95&amp;rev=1589702211&amp;do=diff</link>
        <description>图的多种存储方法

刚好最近课程进行到了图论，而图论最首要的就是存图。所以总结一下我所知道的一些图的存储方法。


邻接矩阵

相当基础的存储方法。

图的构成无非点与边，而边则是由两个点连成，因此我们可以用n*n（n为点数）的方阵来存储图。</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E5%8F%8A%E5%85%B6%E4%BC%98%E5%8C%96&amp;rev=1590156969&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-22T22:16:09+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:深度优先搜索及其优化</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E5%8F%8A%E5%85%B6%E4%BC%98%E5%8C%96&amp;rev=1590156969&amp;do=diff</link>
        <description>深度优先搜索及其优化

大家都会

原理

深度优先搜索也就是DFS，俗称一条路走到黑，是暴力的好帮手。

基本原理是找到一个没有访问过的节点，继续访问其一个子节点，不断往深处走，直到没有子节点（</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E8%AE%A1%E7%AE%97&amp;rev=1591011124&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-06-01T19:32:04+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:表达式的计算</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:%E8%A1%A8%E8%BE%BE%E5%BC%8F%E7%9A%84%E8%AE%A1%E7%AE%97&amp;rev=1591011124&amp;do=diff</link>
        <description>格式：

	*  符号使用 +-*/%() 的形式，包括 “（” 也要修改。
	*  统一使用半角字符，区分(和（
	*  不要使用\\刻意分段，要分段就空一行（而且不要一句话就一段）
	*  从一级标题（6个=）、二级标题依次排列</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:a_%E7%AE%97%E6%B3%95&amp;rev=1590758920&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-29T21:28:40+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:a_算法</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:a_%E7%AE%97%E6%B3%95&amp;rev=1590758920&amp;do=diff</link>
        <description>A*算法

A*算法与寻找最短路径的Dijkstra算法有相似之处。（不如说A*其实是Dijkstra的改版）
A*算法的应用场景仅限寻找起始状态到目标状态之间的最短路（Dijktra能找到起始状态到所有节点的最短路）。</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:fayuanyu&amp;rev=1596185471&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-07-31T16:51:11+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:fayuanyu</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:fayuanyu&amp;rev=1596185471&amp;do=diff</link>
        <description>狂暴摸鱼人

发源于

专注数据结构

不会数学

测试页面，进入有风险

本周内容

splay的可用代码 

码力提升

比赛记录

cf 639 div 1

cf 660 div 2

在做了.jpg

整个通用线段树板子

整个通用splay板子

树剖

lct复健

点分 边分

toptree会有吗(不会(即答))(我很怀疑考场上能写这个吗)

dinic模板

尝试一下汇编优化(选做)</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:front_page&amp;rev=1589118021&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-10T21:40:21+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:front_page</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:front_page&amp;rev=1589118021&amp;do=diff</link>
        <description>个人页面

shaco

nomansland

发源于

训练计划

训练计划

训练记录

训练记录

技能树

技能树

比赛记录

比赛记录

会议记录

团队会议记录

个人总结

个人总结

周报

周报</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:nomansland&amp;rev=1590758218&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-29T21:16:58+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:nomansland</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:nomansland&amp;rev=1590758218&amp;do=diff</link>
        <description>摸了

因为太摸把学的都忘了所以从头学起


知识点

表达式的计算

深度优先搜索及其优化

宽度优先搜索及其优化

A*算法</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:shaco&amp;rev=1597919793&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-08-20T18:36:33+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:shaco</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:shaco&amp;rev=1597919793&amp;do=diff</link>
        <description>关于本人

菜的一匹

技能

基础

数据结构

搜索

动态规划

数论

个人训练

尝试了几次cf的比赛之后深深地自闭了...

由于本人会的算法较少、较基础且略生疏，因此决定先扫一遍算法 而且我比较懒（扫多长时间？？）

因此相当一段时间里个人训练都是专项</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record&amp;rev=1590573107&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-27T17:51:47+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record&amp;rev=1590573107&amp;do=diff</link>
        <description>2020/05/09 北方大学ACM多校训练赛 第四场 1/1/6

2020/05/10 北方大学ACM多校训练赛 第五场 0/0/6

2020/05/16 牛客假日团队赛41 3/3/12 

2020/05/24 牛客假日团队赛40 2/2/12</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week1&amp;rev=1591342064&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-06-05T15:27:44+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:week1</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week1&amp;rev=1591342064&amp;do=diff</link>
        <description>2020/05/02--2020/05/08

----------

团队训练

暂无

----------

王瑞琦

专题

	*  树

还没有打比赛orz，稍微练了几道树的题

冯宇扬

专题

	*  lct复健

比赛

	*  没打

常程

专题

	*  尺取法
	*  前缀和

（由于我太菜了所以写一点基础的）</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week2&amp;rev=1589646007&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-17T00:20:07+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:week2</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:week2&amp;rev=1589646007&amp;do=diff</link>
        <description>2020/05/09--2020/05/15

----------

团队训练

2020.05.09 北方大学ACM多校训练赛第四场 pro:1/2/6

2020.05.10 北方大学ACM多校训练赛第五场 pro:0/0/6

----------

王瑞琦

----------

比赛

暂无

专题

因为课程刚好讲到图论，所以就顺带学习了一下深度优先搜索及其优化

冯宇扬

比赛

cf round 639 div 1 

由于网络条件问题不能进行实时比赛(真的每次一到比赛时间就血卡，白天都挺好)</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:weekly&amp;rev=1599056372&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-09-02T22:19:32+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:weekly</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:weekly&amp;rev=1599056372&amp;do=diff</link>
        <description>2020/05/02--2020/05/08

2020/05/09--2020/05/15

2020/05/16--2020/05/22

2020/05/23--2020/05/29

2020/05/30--2020/06/05

2020/06/06--2020/06/12

2020/07/11--2020/07/17

2020/07/18--2020/07/24

2020/07/25--2020/07/31

2020/08/01--2020/08/07

2020/08/08--2020/08/14

2020/08/15--2020/08/21

2020/08/22--2020/08/28

2020/08/29--2020/09/04</description>
    </item>
</rdf:RDF>
