添加题解

基础调试

选择编程语言

比赛策略

编程比赛

参与贡献

在命令行中使用 C++

数据类型

如何调试

C++ 调试

前置知识要求

快速输入输出

（选学）C++——编写泛型代码

输入与输出

算法竞赛简介

（可选）C++ Lambda 表达式

资源：学习编程

模块介绍

信息学奥林匹克竞赛

如何练习

资源：算法竞赛

资源：美国相关

在本地运行代码

在线运行代码

USACO 集训营

USACO 常见问题

USACO 月赛题目

如何使用本指南

使用 MDX

非典型问题

分类讨论

使用递归的完全搜索

USACO 铜组补充练习

基础完全搜索

数据结构简介

图简介

贪心算法简介

集合与映射简介

排序简介

矩形几何

模拟

时间复杂度

组合数学

整除

模运算

Binary Search

Binary Search on a Sorted Array

Additional Practice for USACO Silver

Flood Fill

Introduction to Functional Graphs

Graph Traversal

Greedy Algorithms with Sorting

Intro to Bitwise Operators

Introduction to Tree Algorithms

More on Prefix Sums

Introduction to Prefix Sums

Priority Queues

Custom Comparators and Coordinate Compression

Two Pointers

DP on Trees - Solving For All Roots

Additional Practice for USACO Gold

(Optional) Sorted Sets with Custom Comparators

Bitmask DP

Range DP

DP on Trees - Introduction

Disjoint Set Union

Digit DP

Hashing

(Optional) Hashmaps

Introduction to DP

More Operations on Sorted Sets

Knapsack DP

(Optional) LCA with Euler Tour

Longest Increasing Subsequence

Minimum Spanning Trees

(Optional) Meet In The Middle

Point Update Range Sum

Paths on Grids

Shortest Paths with Non-Negative Edge Weights

Sliding Window

Stacks

Optimizing Unimodal Functions

Topological Sort

(Optional) Euler Tour Technique

Shortest Paths with Unweighted Edges

2D Range Queries

Binary Jumping

(Optional) Bitsets

Centroid Decomposition

Additional Practice for USACO Platinum

Convex Hull

Convex Hull Trick

Divide & Conquer - DP

Divide & Conquer - SRQ

Sum over Subsets DP

Geometry Primitives

Heavy-Light Decomposition

Matrix Exponentiation

Small-To-Large Merging

Inclusion-Exclusion Principle

/*- Can currently download PDF for [free](https://link.springer.com/book/10.1007/978-3-319-72547-5)!*/
/*- [Competitive Programming 3](https://cpbook.net/) is relevant and but costs money.*/
/*Some of the more popular ones include [Introduction to Algorithms](http://mitpress.mit.edu/books/introduction-algorithms), by Cormen, Leiserson, Rivest, and Stein, [Algorithm Design](https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358), by Kleinberg and Tardos, [The Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1848000693), by Skiena, and [Algorithms](http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X) by Sedgewick and Wayne.*/
/*- [Cousera Algorithms Pt 1 (and Pt 2)](https://www.coursera.org/learn/algorithms-part1) - Kevin Wayne, Robert Sedgewick
- Java (has anyone done this course?)*/
/*- [Algorithms Conquered](https://www.youtube.com/channel/UCVp5MlM5aQbhObh5JYlgHUw)*/
/*- [Codeforces With Java](https://www.youtube.com/channel/UCJtyODN6zjWnl4lwLHwfdcw)*/
/*- [Colin Galen](https://www.youtube.com/channel/UCpvS3EykHW--l0ogUhMEjEw)*/
/*- [Dardev](https://www.youtube.com/channel/UC0PYAh68WLY69tMXCzPKpLA)*/
/*- [Juis enrique vargas azcona](https://www.youtube.com/user/luisoncpp)*/
/*- [MIT OCW](https://www.youtube.com/c/mitocw/)*/
/*- [Niema Moshiri](https://www.youtube.com/channel/UC05LugecRCvKLip8Tqz2krA)*/
/*- [Stable Sort](https://www.youtube.com/channel/UCV2g02zq5y7unJ_GSr-de2w)*/
/*- [Stefan Dascalescu](https://www.youtube.com/channel/UCyTPeByJ_FvAJljtc0svt-Q)*/
/*- [VPLanet](https://www.youtube.com/channel/UCdNNY8Y8meG3z9Wy6MTzcLg)*/
/*- some more from TJHSST:*/
/*- [TJIOI](https://github.com/tjsct/tjioi-study-guide) (just basics)*/
"use strict";
const {Fragment: _Fragment, jsx: _jsx, jsxs: _jsxs} = arguments[0];
const frontmatter = undefined;
function _createMdxContent(props) {
  const _components = {
    a: "a",
    h2: "h2",
    h3: "h3",
    li: "li",
    p: "p",
    ul: "ul",
    ...props.components
  }, {HeaderLink} = _components;
  if (!HeaderLink) _missingMdxReference("HeaderLink", true);
  return _jsxs(_Fragment, {
    children: [_jsxs(_components.h2, {
      id: "资源列表",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#资源列表",
        children: _jsx(HeaderLink, {})
      }), "资源列表"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "http://codeforces.com/blog/entry/23054",
          rel: "nofollow",
          target: "_blank",
          children: "Awesome List (Inishan)"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://noi.ph/prepare/",
          rel: "nofollow",
          target: "_blank",
          children: "Philippines OI - Prepare"
        })
      }), "\n"]
    }), "\n", _jsxs(_components.h2, {
      id: "本指南中常用的资源",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#本指南中常用的资源",
        children: _jsx(HeaderLink, {})
      }), "本指南中常用的资源"]
    }), "\n", _jsx(_components.p, {
      children: "本指南会频繁引用以下资源。"
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://cp-algorithms.com/",
          rel: "nofollow",
          target: "_blank",
          children: "cp-algorithms"
        })
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://cses.fi/book/book.pdf",
          rel: "nofollow",
          target: "_blank",
          children: "Competitive Programmer's Handbook"
        }), " (CPH) -\nAntti Laaksonen\n", _jsxs(_components.ul, {
          children: ["\n", _jsxs(_components.li, {
            children: [_jsx(_components.a, {
              href: "https://cses.fi/problemset/",
              rel: "nofollow",
              target: "_blank",
              children: "CSES 题集"
            }), "质量很好，目前约有 400 道题。\n", _jsxs(_components.ul, {
              children: ["\n", _jsx(_components.li, {
                children: "它没有官方题解，但遇到困难时，下面的链接可能有帮助。"
              }), "\n", _jsx(_components.li, {
                children: _jsx(_components.a, {
                  href: "https://github.com/superj6/CPcode/tree/master/c%2B%2B%20sol/CSES",
                  rel: "nofollow",
                  target: "_blank",
                  children: "200+ Solutions in C++ (superj6)"
                })
              }), "\n"]
            }), "\n"]
          }), "\n", _jsxs(_components.li, {
            children: [_jsx(_components.a, {
              href: "https://www.springer.com/us/book/9783030393564",
              rel: "nofollow",
              target: "_blank",
              children: "Guide to Competitive Programming"
            }), "\n是一本以 CPH 为基础编写的付费书籍。\n", "\n"]
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: ["Intro to USACO (Bronze, Silver) - Darren Yao\n", _jsxs(_components.ul, {
          children: ["\n", _jsxs(_components.li, {
            children: [_jsx(_components.a, {
              href: "http://darrenyao.com/usacobook/java.pdf",
              rel: "nofollow",
              target: "_blank",
              children: "Java"
            }), ",\n", _jsx(_components.a, {
              href: "http://darrenyao.com/usacobook/cpp.pdf",
              rel: "nofollow",
              target: "_blank",
              children: "C++"
            }), " 版本"]
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://jsannemo.se/latest.pdf",
          rel: "nofollow",
          target: "_blank",
          children: "Principles of Algorithmic Problem Solving"
        }), " -\nJohan Sannemo\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "包含来自 Kattis 的练习题"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: ["Competitive Programming Book - Steven Halim, Felix Halim\n", _jsxs(_components.ul, {
          children: ["\n", _jsxs(_components.li, {
            children: [_jsx(_components.a, {
              href: "https://www.comp.nus.edu.sg/~stevenha/myteaching/competitive_programming/cp2.pdf",
              rel: "nofollow",
              target: "_blank",
              children: "Competitive Programming 2"
            }), "\n可以免费获取，但内容较旧。"]
          }), "\n", _jsxs(_components.li, {
            children: [_jsx(_components.a, {
              href: "https://cpbook.net/",
              rel: "nofollow",
              target: "_blank",
              children: "Competitive Programming 4"
            }), " 是最新版本，增加了大量内容，但需要付费。"]
          }), "\n"]
        }), "\n"]
      }), "\n"]
    }), "\n", "\n", _jsxs(_components.h2, {
      id: "书籍",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#书籍",
        children: _jsx(HeaderLink, {})
      }), "书籍"]
    }), "\n", _jsx(_components.p, {
      children: "以下不包括上文已经提到的书籍。"
    }), "\n", _jsxs(_components.h3, {
      id: "算法竞赛",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#算法竞赛",
        children: _jsx(HeaderLink, {})
      }), "算法竞赛"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://www.dropbox.com/s/z2lur71042pjaet/guide.pdf?dl=0",
          rel: "nofollow",
          target: "_blank",
          children: "CS Guide"
        }), " - Samuel Hsiang,\nAlexander Wei, Yang Liu"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "http://www.amazon.com/Programming-Challenges-Contest-Training-Computer/dp/0387001638",
          rel: "nofollow",
          target: "_blank",
          children: "Programming Challenges"
        }), " -\nSteven Skiena, Miguel Revilla"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://www.mimuw.edu.pl/~idziaszek/algonotes/looking-for-a-challenge-2-en.pdf",
          rel: "nofollow",
          target: "_blank",
          children: "Looking for a Challenge"
        }), "\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "由一批参与波兰信息学奥林匹克的作者编写"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "http://www.crackingthecodinginterview.com/",
          rel: "nofollow",
          target: "_blank",
          children: "Cracking the Coding Interview"
        }), "\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "专门面向技术面试的优秀书籍"
          }), "\n"]
        }), "\n"]
      }), "\n"]
    }), "\n", _jsxs(_components.h3, {
      id: "通用算法书籍",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#通用算法书籍",
        children: _jsx(HeaderLink, {})
      }), "通用算法书籍"]
    }), "\n", "\n", _jsxs(_components.p, {
      children: ["参见 ", _jsx(_components.a, {
        href: "http://www.usaco.org/index.php?page=resources",
        rel: "nofollow",
        target: "_blank",
        children: "USACO 资源页面"
      }), "。"]
    }), "\n", _jsxs(_components.h2, {
      id: "课程",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#课程",
        children: _jsx(HeaderLink, {})
      }), "课程"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://github.com/SuprDewd/T-414-AFLV",
          rel: "nofollow",
          target: "_blank",
          children: "Competitive Programming Course"
        }), " -\nBjarki Ágúst Guðmundsson\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "包含来自 Kattis 的练习题"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://contest.cs.cmu.edu/295/f17/",
          rel: "nofollow",
          target: "_blank",
          children: "Carnegie-Mellon ICPC Course"
        }), " - Danny\nSleator\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "Codeforces 群组中的专题比赛"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://www.vplanetcoding.com/usaco-preparation-blogs",
          rel: "nofollow",
          target: "_blank",
          children: "VPlanet"
        }), " - Riya Arora\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "面向不同水平的课程"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://codeforces.com/edu/courses",
          rel: "nofollow",
          target: "_blank",
          children: "Codeforces Edu"
        }), " - ITMO University\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "中级至高级的数据结构与算法"
          }), "\n"]
        }), "\n"]
      }), "\n"]
    }), "\n", "\n", _jsxs(_components.h2, {
      id: "算法实现与模板",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#算法实现与模板",
        children: _jsx(HeaderLink, {})
      }), "算法实现与模板"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://github.com/kth-competitive-programming/kactl",
          rel: "nofollow",
          target: "_blank",
          children: "KTH ICPC Team Reference (KACTL)"
        }), "\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "ICPC 队伍参考手册"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://github.com/bqi343/USACO",
          rel: "nofollow",
          target: "_blank",
          children: "USACO Github"
        }), " - Benjamin Qi\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "ICPC 队伍参考手册"
          }), "\n", _jsx(_components.li, {
            children: "历年 USACO 题解"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://ekzlib.netlify.app/home",
          rel: "nofollow",
          target: "_blank",
          children: "ekzlib"
        }), " - Eric Zhang\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "进阶算法实现"
          }), "\n"]
        }), "\n"]
      }), "\n"]
    }), "\n", _jsxs(_components.h2, {
      id: "youtube-频道",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#youtube-频道",
        children: _jsx(HeaderLink, {})
      }), "YouTube 频道"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCBLr7ISa_YDy5qeATupf26w",
          rel: "nofollow",
          target: "_blank",
          children: "Algorithms Live!"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCSQmpb_K_I37JN-QLArZbFw",
          rel: "nofollow",
          target: "_blank",
          children: "benritmicocode"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCBr_Fu6q9iHYQCh13jmpbrg",
          rel: "nofollow",
          target: "_blank",
          children: "Errichto"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA",
          rel: "nofollow",
          target: "_blank",
          children: "Jonathan Paulson"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCXbCohpE9IoVQUD2Ifg1d1g",
          rel: "nofollow",
          target: "_blank",
          children: "SecondThread"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/channel/UCKuDLsO0Wwef53qdHPjbU2Q",
          rel: "nofollow",
          target: "_blank",
          children: "William Lin"
        })
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "https://www.youtube.com/user/purpongie",
          rel: "nofollow",
          target: "_blank",
          children: "WilliamFiset"
        })
      }), "\n"]
    }), "\n", "\n", "\n", "\n", "\n", "\n", "\n", "\n", "\n", "\n", "\n", _jsxs(_components.h2, {
      id: "其他资源",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#其他资源",
        children: _jsx(HeaderLink, {})
      }), "其他资源"]
    }), "\n", _jsxs(_components.ul, {
      children: ["\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "https://visualgo.net/en",
          rel: "nofollow",
          target: "_blank",
          children: "VisuAlgo"
        }), "\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "动态算法可视化工具"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsxs(_components.li, {
        children: [_jsx(_components.a, {
          href: "http://www.topcoder.com/community/data-science/data-science-tutorials/",
          rel: "nofollow",
          target: "_blank",
          children: "Topcoder Data Science Tutorials"
        }), "\n", _jsxs(_components.ul, {
          children: ["\n", _jsx(_components.li, {
            children: "内容很多，但排版不总是理想"
          }), "\n"]
        }), "\n"]
      }), "\n", _jsx(_components.li, {
        children: _jsx(_components.a, {
          href: "http://codeforces.com/blog/entry/57282",
          rel: "nofollow",
          target: "_blank",
          children: "List of CF Tutorials"
        })
      }), "\n"]
    }), "\n", "\n"]
  });
}
function MDXContent(props = {}) {
  const {wrapper: MDXLayout} = props.components || ({});
  return MDXLayout ? _jsx(MDXLayout, {
    ...props,
    children: _jsx(_createMdxContent, {
      ...props
    })
  }) : _createMdxContent(props);
}
return {
  frontmatter,
  default: MDXContent
};
function _missingMdxReference(id, component) {
  throw new Error("Expected " + (component ? "component" : "object") + " `" + id + "` to be defined: you likely forgot to import, pass, or provide it.");
}


Table of Contents

Table of Contents

资源列表

本指南中常用的资源

书籍

算法竞赛

通用算法书籍

课程

算法实现与模板

YouTube 频道

其他资源

Module Progress: