代码如下:
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n;
double x[N], y[N];
double s[N][N];//代表从第i个点到j个点之间的最小弦长
double dist(int i, int j) {//计算机两点之间的距离
return sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
for (int len = 3; len <= n; len++) {//从第三个点开始
for (int l = 0; l+len-1 < n; l++) {
int r = l+len-1;
s[l][r]=1e18;
for (int k = l+1; k < r; k++) {
s[l][r]=min(s[l][r],s[l][k]+s[k][r]+dist(l,r));
}
}
}
printf("%.3lf\n", s[0][n-1]-dist(0,n-1));
return 0;
}
对于最后为什么输出s[0][n-1]-dist(0,n-1),以下图解:
思路图解: