摘要: Problem S: the set of numbers said by player 1; P: the set of numbers said by player 2; S^2 * P = a; S * P^2 = b; a * b = (S * P)^3, so a * b must be 阅读全文
posted @ 2022-01-18 06:35 Review->Improve 阅读(9) 评论(0) 推荐(0) 编辑
摘要: Problem Each fence is increased at most 2 times, so dp[i][j] is the min cost to make A[0, i] great with the last fence A[i] increased j times. The ans 阅读全文
posted @ 2022-01-18 03:22 Review->Improve 阅读(24) 评论(0) 推荐(0) 编辑