Задачи

Лесно · Scanline / Sweep Line · Sorting · Data Structures · Geometry

Средно · Dijkstra algorithm · Shortest paths · Graphs

Много лесно · Dynamic programming · Graphs · Shortest paths

Трудно · Sorting · Geometry

Трудно · Dynamic programming · Bitmasks · Binary Search

Много трудно · Depth-first Search · Dynamic programming · Graphs · Shortest paths

Лесно · Greedy algorithms · Strings

Средно · Greedy algorithms · Math

Трудно · Combinatorics · Sorting · Greedy algorithms

Трудно · Graphs · Depth-first Search · Disjoint set union · Implementation

Трудно · Greedy algorithms · Stacks · Prefix Sums · Queries

Трудно · Constructive Algorithms · Greedy algorithms · Prefix Sums

Много лесно · Bitmasks · Dynamic programming · Combinatorics

Трудно · Shortest paths · Breadth-first Search · Graphs

Много трудно · Graphs · Sorting · Two pointers · Data Structures

Трудно · Breadth-first Search · Graphs · Combinatorics · Prefix Sums · Number theory

Много трудно · Dynamic programming · Dynamic Programming Optimization · Binary Search · Stacks

Много трудно · Graphs · Depth-first Search · Fenwick Tree · Prefix Sums · Data Structures

Средно · Implementation

Лесно · Implementation

Много лесно · Math · Geometry

Трудно · Breadth-first Search · Greedy algorithms

Средно · Greedy algorithms · Sorting

Много трудно · Dynamic programming · Prefix Sums · Data Structures

Трудно · Games · Combinatorics · Prefix Sums · Number theory · Greedy algorithms