UVA - 116 Unidirectional TSP (多段图的最短路)
题目链接:UVA - 116 Unidirectional TSP
#include <bits/stdc++.h>
using namespace std;
int a[105][105], dp[105][105], nex[105][105];
int main()
{
int n, m, i, j, k;
while(scanf("%d %d", &...
原创
2018-08-11 11:18:43 ·
142 阅读 ·
0 评论