3650. 带边反转的最小代价路径
Medium | Graph Theory, Heap (Priority Queue), Shortest Path
Medium | Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)
Medium | Array, Greedy, Sorting, Heap (Priority Queue)
Medium | Array, Greedy, Sorting, Heap (Priority Queue)
Medium | Array, String, Greedy, Heap (Priority Queue)
Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set
Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting, Heap (Priority Queue)
Easy | Array, Sorting, Heap (Priority Queue), Simulation
Hard | Array, Binary Search, Greedy, Heap (Priority Queue)