POJ1502最简单的dijk算法应用+sscanf(cstring,"%d",&t)处理技巧
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define Max 0x3f3f3f3f
using namespace std;
const int maxn = 107;
int map[maxn][maxn];
bool vis[maxn];
int D[maxn];
void dijk(i
原创
2017-07-13 19:47:53 ·
364 阅读 ·
0 评论