本文介绍了一种用于确定游览一系列景点时的最优路径算法。该算法通过计算并移除一个虚拟点来最小化总距离，适用于给定点集的特定位置布局。通过分析点之间的相对距离变化来决定最佳移除点，进而实现最短路径的计算。
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
class FoxAndSightseeing{
public:
int getMin(vector <int> position){
int distanceLess[position.size()];
for(int i=1;i<position.size()-1;i++){
distanceLess[i]=abs(position[i]-position[i-1])+abs(position[i]-position[i+1])-abs(position[i+1]-position[i-1]);
}
int missingPoint=1;
int maxDistanceLess=0;
for(int i=1;i<position.size()-1;i++){
if(distanceLess[i]>maxDistanceLess){
missingPoint=i;
maxDistanceLess=distanceLess[i];
}
}
int ret=0;
for(int i=1;i<position.size();i++){
if(i!=missingPoint){
ret+=abs(position[i]-position[i-1]);
}
else{
ret+=abs(position[i+1]-position[i-1]);
i++;
}
cout<<"ret:"<<ret<<" i:"<<i<<endl;
}
return ret;
}
};
#include <vector>
#include <cmath>
using namespace std;
class FoxAndSightseeing{
public:
int getMin(vector <int> position){
int distanceLess[position.size()];
for(int i=1;i<position.size()-1;i++){
distanceLess[i]=abs(position[i]-position[i-1])+abs(position[i]-position[i+1])-abs(position[i+1]-position[i-1]);
}
int missingPoint=1;
int maxDistanceLess=0;
for(int i=1;i<position.size()-1;i++){
if(distanceLess[i]>maxDistanceLess){
missingPoint=i;
maxDistanceLess=distanceLess[i];
}
}
int ret=0;
for(int i=1;i<position.size();i++){
if(i!=missingPoint){
ret+=abs(position[i]-position[i-1]);
}
else{
ret+=abs(position[i+1]-position[i-1]);
i++;
}
cout<<"ret:"<<ret<<" i:"<<i<<endl;
}
return ret;
}
};
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
