Есептер

Maximum Sum#2911

Жеңіл · Segment Tree · Prefix Sums · Queries

Glass Beads#2912

Өте жеңіл · Strings

XOR pairs#2915

Жеңіл · Binary Search

Translating pebbles#2918

Жеңіл · Greedy algorithms

Is this the left heap?#2919

Жеңіл · Binary Search · Data Structures

Height of the left tree#2920

Орташа · Data Structures · Math · Binary Search

The Right Path of the Left Tree#2921

Өте жеңіл · Binary Search

Union of rectangles 2#2922

Өте жеңіл · Sorting · Geometry

Tree#2923

Өте жеңіл · Trees

Tree in a Segment#2924

Жеңіл · Depth-first Search · Trees · Queries

Strings in the Tree#2925

Қиын · Graphs · String suffix structures

Combined rectangles#2926

Өте жеңіл · Geometry · Sorting

Union of Sets#2927

Өте жеңіл · Sorting

Non-prefix codes#2928

Жеңіл · Greedy algorithms

Rain#2929

Жеңіл · Geometry · Dynamic programming

Dima and the Famous Tourist#2931

Жеңіл · Graphs · Shortest paths

Dima and lines#2932

Өте жеңіл · Implementation · String suffix structures · Data Structures

Dima and the Computer Game#2933

Өте жеңіл · Geometry

Dima and the permutation#2934

Жеңіл · Graphs

Dima and Percentages#2935

Жеңіл · Probabilities · Strings

Dima & module#2936

Қиын · Number theory · Bitwise Operations · Math

Maksym and the Time Machine#2937

Жеңіл · Segment Tree · Implementation

Dima and the Time Machine#2938

Өте жеңіл · Segment Tree · Prefix Sums

Dima and array 1#2939

Жеңіл · Segment Tree · Implementation

2776-2800 / 9226