P – The Shortest Path in Nya Graph（建图/最短路）
This is a very easy problem, your task is just cal …
N – Tram（最短路）
Tram network in Zagreb consists of a number of int …
M – 昂贵的聘礼（超级源点？）
年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋 …
O – Extended Traffic(SPFA判负环)
Dhaka city is getting crowded and noisy day by day …
S – Layout（差分约束）
Like everyone else, cows like to stand clos …
L – Subway
You have just moved from a quiet Waterloo neighbou …
K – Candies （差分约束）
During the kindergarten days, flymouse was the mon …
差分约束系统（转）
https://blog.csdn.net/my_sunshine26/article/detail …