摘要： /*poj2253Frogger题意：青蛙要通过到石头到达终点 要达到终点最小步幅不能小于多少dijkstra*/#include<iostream>#include<algorithm>#include<queue>#include<cmath>using namespace std;#define MAXN 1111#define INF 100000000pair <double,int> pii;double x[MAXN],y[MAXN],d[MAXN];int inq[MAXN];int n;double DIS(int 阅读全文