旅行商问题,边费用为max(a[j]-a[i],c[i])
2021-04-06
Codeforces Round /#712 (Div. 2) E. Travelling Salesman Problem
Codeforces Round /#580 (Div. 2) D. Shortest Cycle(Floyd求最小环)