Accommodation

Routing

Approximate Diameter

近似算法

Flow Control

Code Lock

We Need the Zero

The String Has a Target

Place for a Selfie

A Wide, Wide Graph

There Should Be a Lot of Maximums

莫队 · 线段树 · 树论 · 分块 · 线段树合并

Survival of the Weakest (hard version)

贪心 · 堆

Survival of the Weakest (easy version)

堆

Walking Master

Mex Master

Sequence Master

Ad-hoc

DSU Master

动态规划 DP

Tree Master

剪枝 · 分块 · 根号分治

GCD Master (hard version)

GCD Master (easy version)

Plus or Minus

Grab the Candies

Find and Replace

Odd Queries

Interview

Bouncy Ball

Subsequence Addition (Hard Version)

Subsequence Addition (Easy Version)

Lucky Numbers

Playing in a Casino

Unlucky Numbers

Petya, Petya, Petr, and Palindromes

Minibuses on Venus (hard version)

Minibuses on Venus (medium version)

Minibuses on Venus (easy version)

Garland

Points on Plane

Sum on Subarrays

Binary String Sorting

Two Tanks

Traveling in Berland

贪心 · 倍增

Prediction

Beautiful Sequence

Candies

Make It Permutation

Climbing the Tree

数学

Monsters

M-tree

数学 · 线段树

The Maximum Prefix

动态规划 DP · 概率论 · 期望

Last Number

Insert Digit