摘要：
http://lightoj.com/volume_showproblem.php?problem=1002求最长路径的最小值，用优先队列的dijkstra。#include<cstdio>#include<cstring>#include<cstdlib>#include<queue>#include<algorithm>using namespace std;const int MAXN = 1 << 9;int dist[MAXN], g[MAXN][MAXN];int n, m, t;const int inf = 阅读全文
posted @ 2012-07-28 17:09
找回失去的
阅读(576)
评论(0)
推荐(0)
摘要：
http://lightoj.com/volume_showproblem.php?problem=1019裸的dij，注意两点之间有多条边，因为这个WA了一次。#include<cstdio>#include<cstring>#include<cstdlib>#include<queue>#include<algorithm>using namespace std;const int MAXN = 1 << 7;int d[MAXN], g[MAXN][MAXN];const int inf = 0x3f3f3f3f;i 阅读全文
posted @ 2012-07-28 17:05
找回失去的
阅读(231)
评论(0)
推荐(0)
摘要：
http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1128这道题是裸的强连通分量，之前没有写类似的题，所以敲的很辛苦。/*Accepted 920 KB 32 ms C++ 2240 B 2012-07-28 16:54:39*/#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;const int MAXN = 1 << 7;struct edge{ int v 阅读全文
posted @ 2012-07-28 16:58
找回失去的
阅读(228)
评论(0)
推荐(0)
浙公网安备 33010602011771号