Solution -「CF 888E」Maximum Subsequence
DescriptionLink.给一个数列和 $m$，在数列任选若干个数，使得他们的和对 $m$ 取模后最大。Solution记录一下犯下的一个 nt 错误。首先我们有一个显然的 DFS 暴力，...
In mathematics you don't understand things, you just get used to them.
In mathematics you don't understand things, you just get used to them.