添加题解

基础调试

选择编程语言

比赛策略

编程比赛

参与贡献

在命令行中使用 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

"use strict";
const {Fragment: _Fragment, jsx: _jsx, jsxs: _jsxs} = arguments[0];
const frontmatter = undefined;
function _createMdxContent(props) {
  const _components = {
    a: "a",
    h2: "h2",
    p: "p",
    strong: "strong",
    ...props.components
  }, {Asterisk, HeaderLink, Problems} = _components;
  if (!Asterisk) _missingMdxReference("Asterisk", true);
  if (!HeaderLink) _missingMdxReference("HeaderLink", true);
  if (!Problems) _missingMdxReference("Problems", 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.p, {
      children: ["完成 USACO Guide 的这一部分后，你应该已经熟悉历年来 USACO 铜组中出现过的\n各类主题。", _jsx(Asterisk, {
        children: "当然，未来的铜组比赛仍有可能出现其他主题，甚至可能来自\n更高组别。"
      }), "为了尽可能提高晋级概率，你应该通过完成更多题目来", _jsx(_components.strong, {
        children: "练习"
      }), "。"]
    }), "\n", _jsxs(_components.h2, {
      id: "未分类题目",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#未分类题目",
        children: _jsx(HeaderLink, {})
      }), "未分类题目"]
    }), "\n", _jsxs(_components.p, {
      children: ["下面列出了一些我们认为难度大致属于铜组、但不太适合放入前面模块的题目。\n", _jsx(Asterisk, {
        children: "可能是因为对应模块中的题目已经太多，也可能是因为这些题目需要结合\n多个概念。"
      }), "此处标注的难度是相对于铜组而言的（不过难度具有主观性，\n也不一定始终准确）。随着收到更多题目推荐，我们会继续扩充这份列表。"]
    }), "\n", _jsx(Problems, {
      problems: "problems",
      pageSize: 12
    }), "\n", _jsxs(_components.h2, {
      id: "最后的话",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#最后的话",
        children: _jsx(HeaderLink, {})
      }), "最后的话"]
    }), "\n", _jsxs(_components.p, {
      children: ["请参阅常见问题中的\n", _jsx(_components.a, {
        href: "/general/usaco-faq#q-where-can-i-find-more-practice-problems",
        children: "在哪里可以找到更多练习题"
      }), "。\n你也可以阅读", _jsx(_components.a, {
        href: "/general/practicing",
        children: "如何练习"
      }), "模块。祝你在今后的比赛中好运！"]
    })]
  });
}
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.");
}


Source	Problem Name	Difficulty	Tags
CF	Election	Very Easy
CF	Who's Opposite?	Very Easy	Show Tags Math
CSES	Reading Books	Easy
CF	Quests	Easy	Show Tags Complete Search, Prefix Sums
CF	MIN-MEX Cut	Easy	Show Tags Casework
Silver	Field Reduction	Medium	Show Tags Complete Search, Rectangle
CF	Palindromes Coloring	Medium	Show Tags Greedy
CF	Absolute Sorting	Medium	Show Tags Casework
Old Bronze	It's All About the Base	Medium	Show Tags Map, Two Pointers
CF	ABBC or BACB	Medium	Show Tags Greedy
Kattis	GMO	Medium	Show Tags Strings
CSES	Digit Queries	Medium	Show Tags Math

Table of Contents

Table of Contents

接下来做什么？

未分类题目

最后的话

Module Progress: