Probleme

Maximum Sum#2911

Ușor · Segment Tree · Prefix Sums · Queries

Glass Beads#2912

Foarte ușor · Strings

XOR pairs#2915

Ușor · Binary Search

Translating pebbles#2918

Ușor · Greedy algorithms

Is this the left heap?#2919

Ușor · Binary Search · Data Structures

Height of the left tree#2920

Mediu · Data Structures · Math · Binary Search

The Right Path of the Left Tree#2921

Foarte ușor · Binary Search

Union of rectangles 2#2922

Foarte ușor · Sorting · Geometry

Tree#2923

Foarte ușor · Trees

Tree in a Segment#2924

Ușor · Depth-first Search · Trees · Queries

Strings in the Tree#2925

Dificil · Graphs · String suffix structures

Combined rectangles#2926

Foarte ușor · Geometry · Sorting

Union of Sets#2927

Foarte ușor · Sorting

Non-prefix codes#2928

Ușor · Greedy algorithms

Rain#2929

Ușor · Geometry · Dynamic programming

Dima and the Famous Tourist#2931

Ușor · Graphs · Shortest paths

Dima and lines#2932

Foarte ușor · Implementation · String suffix structures · Data Structures

Dima and the Computer Game#2933

Foarte ușor · Geometry

Dima and Percentages#2935

Ușor · Probabilities · Strings

Dima & module#2936

Dificil · Number theory · Bitwise Operations · Math

Maksym and the Time Machine#2937

Ușor · Segment Tree · Implementation

Dima and the Time Machine#2938

Foarte ușor · Segment Tree · Prefix Sums

Dima and array 1#2939

Ușor · Segment Tree · Implementation

2776-2800 din 9226