Codeforces 好题 Div.1-1
题单介绍
[转存自【题单】Codeforces 好题 Div.1-1](https://www.luogu.com.cn/training/2213)
$\texttt{Codeforces}$ 难度 $2200$ 以上的部分好题,对标洛谷难度蓝~黑。
由于题目数量较多,分了几批处理,这一部分包含比赛号从 $1$ 到 $472$ 的部分。
题目主要包含以下几种类型:
- 图论
- 各种类型的 dp
- 数据结构
- 网络流
- 字符串
- 比较基础的多项式(放心比 Karry 的题简单上万倍)
CF 中的题目大多数偏思维化。因此这些题目有一定的思维难度,比较适合 CF rating 在 2000~2300 左右的人练练手。
题目列表
Bindian Signalizing
Beads
Greedy Change
A Simple Task
Holes
Map
Fairy
Test
Moon Craters
Common ancestor
Beautiful numbers
FreeDiv
Sum of Medians
Powerful array
Azembler
Lucky Country
Buying Sets
Linear Kingdom Races
String Transformation
String
Bits of merry old England
Coloring Brackets
Machine Programming
Power Defence
Archaeology
Cinema
Little Elephant and Retro Strings
Cyclical Quest
Rats
Rhombus
Wall Bars
Game on Tree
Ladies' Shop
Close Vertices
Painting Square
Cats Transport
Kalila and Dimna in the Logging Industry
Ciel and Gondolas
Monsters and Diamonds
Optimize!
Xenia and Tree
Pumping Stations
Watching Fireworks is Fun
Tree and Queries
Vowels
Nanami's Power Plant
The Child and Binary Tree
Serega and Fun
Appleman and Tree
Design Tutorial: Increase the Constraints