3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values ============================================================== :题号: 3572 :题名: Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values :类型: Algorithms(元数据占位) :难度: Medium :原题: `LeetCode 3572 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。