添加题解

基础调试

选择编程语言

比赛策略

编程比赛

参与贡献

在命令行中使用 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",
    ...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: "uncategorized-problems",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#uncategorized-problems",
        children: _jsx(HeaderLink, {})
      }), "Uncategorized Problems"]
    }), "\n", _jsxs(_components.p, {
      children: ["Below we list some problems that we think are roughly Platinum level but don't\nreally fit in previous modules.", _jsx(Asterisk, {
        children: "either because there were too many\nproblems already, or because the problem requires more than one\nconcept"
      }), " The difficulties listed here are relative to the Platinum\ndivision (difficulty is subjective and isn't always accurate though). We'll be\nexpanding this list as we get more problem suggestions."]
    }), "\n", _jsx(Problems, {
      problems: "problems",
      pageSize: 12
    }), "\n", _jsxs(_components.h2, {
      id: "final-thoughts",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#final-thoughts",
        children: _jsx(HeaderLink, {})
      }), "Final Thoughts"]
    }), "\n", _jsxs(_components.p, {
      children: ["Refer to our FAQ to\n", _jsx(_components.a, {
        href: "/general/usaco-faq#q-where-can-i-find-more-practice-problems",
        children: "find more problems to practice"
      }), ".\nYou may also find the ", _jsx(_components.a, {
        href: "/general/practicing",
        children: "How to Practice"
      }), "\nmodule worth reading. Best of luck on future contests!"]
    })]
  });
}
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	Count Paths	Easy	Show Tags DP, Small to Large, Tree, Virtual Tree
CC	Queue	Easy	Show Tags Lazy SegTree
CF	Animal Observation (hard version)	Easy	Show Tags DP, Deque
CF	Julia and Snail	Medium	Show Tags DP, SegTree, Sqrt
CF	Escape Through Leaf	Medium	Show Tags Convex
QOJ	Shuttle Tour	Medium	Show Tags SegTree, Virtual Tree
CF	Sum Queries?	Medium	Show Tags SegTree
Old Gold	Seating	Medium	Show Tags Lazy SegTree
CF	Case of Computer Network	Medium	Show Tags SCC, Tree
JOI	JOI Spring Camp 2019 Day 4 - Cake 3	Hard	Show Tags Divide and Conquer, Sorting, Wavelet
TLX	Her Lost	Hard	Show Tags Centroid
Platinum	Subsequence Reversal	Hard	Show Tags DP

Table of Contents

Table of Contents

Uncategorized Problems

Final Thoughts

Module Progress: