Codeforces Round /#712 (Div. 2) E. Travelling Salesman Problem 旅行商问题,边费用为max(a[j]-a[i],c[i]) 2021-04-06 ACM 题解 Codeforces DP