Frogger POJ
来源:互联网 发布:外链源码 编辑:程序博客网 时间:2024/05/17 03:08
Floyd算法问题
#include<cstdio>#include<iostream>#include<cstring>#define MAXN 220#define INF 123456789#include<math.h>#include<iomanip>using namespace std;int n;double dis[MAXN][MAXN];struct Point{ double x,y;} point[MAXN];double getDis(Point Pt1,Point Pt2){ return sqrt(((Pt1.x-Pt2.x)*(Pt1.x-Pt2.x)+(Pt1.y-Pt2.y)*(Pt1.y-Pt2.y)));}int main(){ int cases=1; while(cin>>n&&n) { for(int i=1; i<=n; ++i) { cin>>point[i].x; cin>>point[i].y; } memset(dis,0,sizeof(dis)); for(int i=1; i<=n; ++i) for(int j=1+1; j<=n; ++j) { dis[i][j]=dis[j][i]=getDis(point[i],point[j]); } int i,j,k; for(k=1; k<=n; k++) for(i=1; i<=n-1; i++) for(j=i+1; j<=n; j++) if(dis[i][k]<dis[i][j] && dis[k][j]<dis[i][j]) if(dis[i][k]<dis[k][j]) dis[i][j]=dis[j][i]=dis[k][j]; else dis[i][j]=dis[j][i]=dis[i][k]; cout<<"Scenario #"<<cases++<<endl; cout<<fixed<<setprecision(3)<<"Frog Distance = "<<dis[1][2]<<endl; cout<<endl; }}
阅读全文
0 0
- POJ Frogger
- 【POJ】Frogger
- Frogger POJ
- Frogger POJ
- Frogger POJ
- Frogger POJ
- Frogger POJ
- poj 2253 - Frogger --- SPFA
- poj 2253 - Frogger --- dijkstra
- POJ 2253 Frogger
- poj 2253 Frogger
- poj 2253 Frogger
- POJ 1125 Frogger (Floyd)
- poj 2253 Frogger
- POJ 2253 Frogger Floyd
- poj 2253 : Frogger (dijkstra)
- Poj 2253 Frogger
- POJ 2253 Frogger
- Xcode插件优缺点对比(推荐20款插件)
- IO流——FileReader
- UVA12186AnotherCrisis
- 硬盘分区之MBR讲解
- oracle sql,using
- Frogger POJ
- robotium通过id实现输入或者点击事件
- WordPress移除头部不必要的元素标签
- Map映射如何迭代
- Python Module_Socket_网络编程
- Noip 2014 生活大爆炸版石头剪刀布
- 最大流dicnic裸题 hdu1532 Summer III
- Node.js中nextTick、setTimeout、setImmediate的区别
- SQL语句学习指南