和poj1797几乎一样的题目,而且还要简单。解题报告直接见poj1797,此题由于数据量比较小故用dp做,可以AC;
1)贪心算法——dijkstra算法变形
下面是代码: 532K+0MS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define Inf 1000010
#define Max 210
#define Maxx(a,b) (a)>(b)?(a):(b)
#define Min(a,b) (a)<(b)?(a):(b)
int node[Max][2];
double dis[Max][Max];
bool vis[Max];
double dp[Max];
int n;
double Dis(int x1,int y1,int x2,int y2){
return sqrt(double((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)));
}
/*void floyd(){
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
dis[i][j]=Min(dis[i][j],Maxx(dis[i][k],dis[k][j]));
printf("Frog Distance = %.3lf\n\n",dis[1][2]);
}*/
void dijkstra(){
int i,j,ind;
double max_d;
memset(vis,0,sizeof(vis));
dp[1]=0;
vis[1]=true;
for(i=2;i<=n;i++)
dp[i]=dis[1][i];
for(i=1;i<n;i++){
max_d=Inf,ind=1;
for(j=1;j<=n;j++)
if(!vis[j] && dp[j]<max_d){
ind=j;
max_d=dp[j];
}
vis[ind]=true;
for(j=1;j<=n;j++)
if(!vis[j] && (Maxx(dp[ind],dis[ind][j]))<dp[j])
dp[j]=Maxx(dp[ind],dis[ind][j]);
}
printf("Frog Distance = %.3lf\n\n",dp[2]);
}
int main(){
int t=1;
while(scanf("%d",&n),n){
for(int i=1;i<=n;i++)
scanf("%d%d",&node[i][0],&node[i][1]);
//memset(dis,0,sizeof(dis));
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i==j)
dis[i][i]=0;
else
dis[i][j]=Dis(node[i][0],node[i][1],node[j][0],node[j][1]);
printf("Scenario #%d\n",t++);
//floyd();
dijkstra();
}
return 0;
}
2)动态规划——floyd算法变形:
下面是代码:524K+110MS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define Max 210
#define Maxx(a,b) (a)>(b)?(a):(b)
#define Min(a,b) (a)<(b)?(a):(b)
int node[Max][2];
double dis[Max][Max];
int n;
double Dis(int x1,int y1,int x2,int y2){
return sqrt(double((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)));
}
void floyd(){
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
dis[i][j]=Min(dis[i][j],Maxx(dis[i][k],dis[k][j]));
printf("Frog Distance = %.3lf\n\n",dis[1][2]);
}
int main(){
int t=1;
while(scanf("%d",&n),n){
for(int i=1;i<=n;i++)
scanf("%d%d",&node[i][0],&node[i][1]);
//memset(dis,0,sizeof(dis));
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i==j)
dis[i][i]=0;
else
dis[i][j]=Dis(node[i][0],node[i][1],node[j][0],node[j][1]);
printf("Scenario #%d\n",t++);
floyd();
}
return 0;
}