![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
三七李
这个作者很懒,什么都没留下…
展开
-
poj 1860 Currency Exchange
dis数组写成int了 神他妈WA一下午…bellman_ford求正环#include <iostream>#define maxn 410 #define inf 0x3f3f3f3fstruct edge{ int u, v; double rate, com; }side[maxn];double dis[maxn];int edge_num, node_num, sourc原创 2017-05-23 17:06:41 · 197 阅读 · 0 评论 -
2016香港网络赛G题 未ac
Problem Gk-Colouring of a GraphYou are given a simple graph with N nodes and M edges. The graph has the special property that any connected component of size s contains no more than s+2 edges. You are原创 2017-05-16 19:45:33 · 298 阅读 · 0 评论 -
POJ1062 昂贵的赠礼 dijkstra
http://poj.org/problem?id=1062 肝爆,现在早上三点了。 最短路,有个条件是等级差…枚举等级区间… 第一条dijkstra…用了大佬的模板… 不说了不说了 睡觉#include <iostream> #include <cstring> #include <vector> #include <queue> #include <algorithm> #inclu原创 2017-07-23 03:05:37 · 208 阅读 · 0 评论