摘要：
次短路与条数#include #include #define N 10005#define INF 0x3f3f3f3fstruct Edge{ int u,val,next;}e[2*N];int p[N],vis[N][2],d[N][2],cnt[N][2];void add(int ... 阅读全文
posted @ 2014-08-14 16:56
SprayT
阅读(150)
评论(0)
推荐(0)
摘要：
最短路与次短路条数#include #include #define N 10005#define INF 0x3f3f3f3fstruct Edge{ int u,val,next;}e[2*N];int p[N],vis[N][2],d[N][2],cnt[N][2];void add(i... 阅读全文
posted @ 2014-08-14 16:54
SprayT
阅读(184)
评论(0)
推荐(0)
摘要：
枚举加最短路#include #include #include #include using namespace std;#define N 105#define INF 0x7f7f7f7fstruct Height{ int low,high,dif;}H[N*N];struct Edg... 阅读全文
posted @ 2014-08-14 16:52
SprayT
阅读(162)
评论(0)
推荐(0)
摘要：
#include #include #include using namespace std;#define N 1005#define INF 0x1f1f1f1fstruct tt{ int x,y,sp;}p[N];int pre[N];bool cmp(tt a, tt b){ ... 阅读全文
posted @ 2014-08-14 16:50
SprayT
阅读(138)
评论(0)
推荐(0)
摘要：
#include #include #include using namespace std;#define N 1005#define INF 0x3f3f3f3fdouble dis[N][N],d[N];double vis[N];double dijkstral(int v0,int n,... 阅读全文
posted @ 2014-08-14 16:48
SprayT
阅读(117)
评论(0)
推荐(0)
摘要：
#include #include #include using namespace std;#define N 1005#define INF 200000000000#define LL __int64LL ma[N][N],d[N],vis[N],dis[N];LL dijkstral(LL ... 阅读全文
posted @ 2014-08-14 16:47
SprayT
阅读(121)
评论(0)
推荐(0)
摘要：
二分加最短路#include #include #define N 1005#define INF 0x3f3f3f3fstruct tt{ int h,cost;}dis[N][N];int vis[N],d[N],num =1;int dijkstral(int v0,int t,int ... 阅读全文
posted @ 2014-08-14 16:46
SprayT
阅读(151)
评论(0)
推荐(0)
摘要：
最短路加字符串处理#include #include #include #include #include #include #include using namespace std;#define N 2005#define INF 0x3f3f3f3f#define LL __int64#def... 阅读全文
posted @ 2014-08-14 16:43
SprayT
阅读(180)
评论(0)
推荐(0)
摘要：
#include #include #include using namespace std;#define N 2005#define INF 0x3f3f3f3f#define LL __int64#define INF 0x3f3f3f3fint ma[N][N],d[N],vis[N],pr... 阅读全文
posted @ 2014-08-14 16:38
SprayT
阅读(149)
评论(0)
推荐(0)
浙公网安备 33010602011771号