添加题解

基础调试

选择编程语言

比赛策略

编程比赛

参与贡献

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

/*<Warning>

These links are provided for convenience only; USACO does not officially endorse or promote any of these sites or programs.

</Warning>*/
/*This list is surely quite incomplete -- if you run or know about other regional programming contests in the USA please email bcdean@clemson.edu to let us know to include a link to your contest!
*/
/*<a href="https://cornell-hspc19.kattis.com/problems">2019 problems</a>*/
/*past problems on <a href="https://icpc.cs.vt.edu/#/hscontest2017">Kattis</a>*/
"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",
    p: "p",
    ...props.components
  }, {HeaderLink, Resource, Resources} = _components;
  if (!HeaderLink) _missingMdxReference("HeaderLink", true);
  if (!Resource) _missingMdxReference("Resource", true);
  if (!Resources) _missingMdxReference("Resources", true);
  return _jsxs(_Fragment, {
    children: ["\n", _jsxs(_components.h2, {
      id: "美国境内的地区性编程比赛",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#美国境内的地区性编程比赛",
        children: _jsx(HeaderLink, {})
      }), "美国境内的地区性编程比赛"]
    }), "\n", "\n", _jsxs(_components.h3, {
      id: "线下比赛",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#线下比赛",
        children: _jsx(HeaderLink, {})
      }), "线下比赛"]
    }), "\n", _jsxs(Resources, {
      children: [_jsx(Resource, {
        source: "University of Central Florida",
        title: "HSPT",
        url: "https://hspt.ucfprogrammingteam.org/index.php/hspt/this-year-s-tournament",
        children: _jsx(_components.p, {
          children: "每队 3 人，比赛 4 小时"
        })
      }), _jsx(Resource, {
        source: "Cornell",
        title: "HSPC",
        url: "https://www.cs.cornell.edu/events/cornell-high-school-programming-contest",
        children: _jsx(_components.p, {
          children: "每队 3 人，比赛 3 小时"
        })
      }), _jsx(Resource, {
        source: "University of Pensylvania",
        title: "PClassic",
        url: "http://pclassic.org",
        children: _jsx(_components.p, {
          children: "每队 4 人，比赛 4 小时，使用 Java 或 Python"
        })
      }), _jsx(Resource, {
        source: "Lockheed Martin",
        title: "Code Quest",
        url: "https://www.lockheedmartin.com/en-us/who-we-are/communities/codequest/code-quest-registration.html",
        children: _jsx(_components.p, {
          children: "每队 3 人，比赛 2.5 小时"
        })
      })]
    }), "\n", "\n", _jsxs(_components.h3, {
      id: "线上比赛",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#线上比赛",
        children: _jsx(HeaderLink, {})
      }), "线上比赛"]
    }), "\n", _jsxs(Resources, {
      children: [_jsx(Resource, {
        source: "Virginia Tech",
        title: "HSPC",
        url: "https://icpc.cs.vt.edu/#/hscontest2017",
        children: _jsx(_components.p, {
          children: "每队 3 人，比赛 5 小时"
        })
      }), _jsx(Resource, {
        source: "University of Central Florida",
        title: "HSPT Online",
        url: "https://hspt.ucfprogrammingteam.org/index.php/hspt-online-edition",
        children: _jsx(_components.p, {
          children: "个人赛，比赛 4 小时"
        })
      }), _jsx(Resource, {
        source: "Montgomery Blair HS",
        title: "mBIT",
        url: "https://mbit.mbhs.edu/",
        children: _jsx(_components.p, {
          children: "每队 4 人，比赛 4 小时"
        })
      }), _jsx(Resource, {
        source: "Lexington HS",
        title: "LIT",
        url: "https://lit.lhsmathcs.org/",
        children: _jsx(_components.p, {
          children: "每队 3 人，比赛 3 小时"
        })
      })]
    }), "\n", "\n", _jsxs(_components.h3, {
      id: "其他活动",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#其他活动",
        children: _jsx(HeaderLink, {})
      }), "其他活动"]
    }), "\n", _jsx(_components.p, {
      children: "以下活动严格来说不属于算法竞赛。"
    }), "\n", _jsx(Resources, {
      children: _jsx(Resource, {
        source: "Carnegie Mellon",
        title: "CMIMC",
        url: "https://cmimc.math.cmu.edu/",
        children: _jsxs(_components.p, {
          children: ["数学竞赛（含计算机科学轮次）。另见 ", _jsx(_components.a, {
            href: "https://cmimc.math.cmu.edu/programming/past-problems",
            rel: "nofollow",
            target: "_blank",
            children: "CMIMC 编程比赛"
          }), "。"]
        })
      })
    }), "\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: ["USACO 是美国选拔学生参加国际科学奥林匹克竞赛的多个全国性组织之一。其他\n主要竞赛包括\n", _jsx(_components.a, {
        href: "https://maa.org/maa-invitational-competitions/",
        rel: "nofollow",
        target: "_blank",
        children: "美国数学奥林匹克（USAMO）"
      }), "、\n", _jsx(_components.a, {
        href: "http://www.aapt.org/physicsteam/program.cfm",
        rel: "nofollow",
        target: "_blank",
        children: "美国物理奥林匹克代表队（USAPhO）"
      }), "、\n", _jsx(_components.a, {
        href: "https://www.acs.org/content/acs/en/education/students/highschool/olympiad.html",
        rel: "nofollow",
        target: "_blank",
        children: "美国国家化学奥林匹克（USNCO）"
      }), "，\n以及", _jsx(_components.a, {
        href: "http://www.usabo-trc.org",
        rel: "nofollow",
        target: "_blank",
        children: "美国生物奥林匹克（USABO）"
      }), "。"]
    })]
  });
}
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

title

Resource

Resources

Table of Contents

Table of Contents

美国境内的地区性编程比赛

线下比赛

线上比赛

其他活动

美国参加的其他国际奥林匹克竞赛

Module Progress:


University of Central Florida	HSPT	每队 3 人，比赛 4 小时
Cornell	HSPC	每队 3 人，比赛 3 小时
University of Pensylvania	PClassic	每队 4 人，比赛 4 小时，使用 Java 或 Python
Lockheed Martin	Code Quest	每队 3 人，比赛 2.5 小时


Virginia Tech	HSPC	每队 3 人，比赛 5 小时
University of Central Florida	HSPT Online	个人赛，比赛 4 小时
Montgomery Blair HS	mBIT	每队 4 人，比赛 4 小时
Lexington HS	LIT	每队 3 人，比赛 3 小时