Codeforces Round 525 (Div2) Posted on 2018-12-12 | In ACM , codeforces Personal training 题目链接A,B,C签到 D 交互题 E题意给一棵点权(可正可负)树，选择任意个不重叠的连通子图，使得 题解