摘要:
D. Fibonacci Paths You are given a directed graph consisting of $n$ vertices and $m$ edges. Each vertex $v$ corresponds to a positive number $a_v$. Co 阅读全文
摘要:
Minimum Operations to Equalize Subarrays You are given an integer array nums and an integer k. In one operation, you can increase or decrease any elem 阅读全文
摘要:
E - Hit and Away Problem Statement You are given a simple connected undirected graph $G$ with $N$ vertices and $M$ edges.The vertices and edges of $G$ 阅读全文