算法竞赛蠕动精华

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

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

http://poj.org/problem?id=1062 肝爆，现在早上三点了。 最短路，有个条件是等级差…枚举等级区间… 第一条dijkstra…用了大佬的模板… 不说了不说了 睡觉#include <iostream>#include <cstring>#include <vector> #include <queue> #include <algorithm>#inclu