https://blog.youkuaiyun.com/lanventzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lanvent/article/details/77725590https://blog.youkuaiyun.com/lanvent/article/details/77725590lanventWed, 30 Aug 2017 21:05:58 +0800https://blog.youkuaiyun.com/lanvent/article/details/77256960https://blog.youkuaiyun.com/lanvent/article/details/77256960lanventWed, 16 Aug 2017 17:46:02 +0800https://blog.youkuaiyun.com/lanvent/article/details/77102642https://blog.youkuaiyun.com/lanvent/article/details/77102642lanventFri, 11 Aug 2017 19:56:53 +0800https://blog.youkuaiyun.com/lanvent/article/details/68496907https://blog.youkuaiyun.com/lanvent/article/details/68496907lanventThu, 30 Mar 2017 20:40:36 +0800 #include #include #include using namespace std; const int MAXN=2222; const int MAXM=2333; const int INF=0x3f3f3]]>https://blog.youkuaiyun.com/lanvent/article/details/68496864https://blog.youkuaiyun.com/lanvent/article/details/68496864lanventThu, 30 Mar 2017 20:36:03 +0800 #include #include <]]>https://blog.youkuaiyun.com/lanvent/article/details/68496601https://blog.youkuaiyun.com/lanvent/article/details/68496601lanventThu, 30 Mar 2017 20:24:55 +0800https://blog.youkuaiyun.com/lanvent/article/details/68494854https://blog.youkuaiyun.com/lanvent/article/details/68494854lanventThu, 30 Mar 2017 20:03:05 +0800https://blog.youkuaiyun.com/lanvent/article/details/68494585https://blog.youkuaiyun.com/lanvent/article/details/68494585lanventThu, 30 Mar 2017 19:59:51 +0800b的最短路和b->a的最短路之和 建反向边，正向反向各dijkstra一次//求源点a和某点b,最大的 a->b的最短路和b->a的最短路之和 正向反向各dj一次 ps:又看错题.. #include #include #include #include #incl]]>https://blog.youkuaiyun.com/lanvent/article/details/68494341https://blog.youkuaiyun.com/lanvent/article/details/68494341lanventThu, 30 Mar 2017 19:57:35 +0800 #include #include <]]>https://blog.youkuaiyun.com/lanvent/article/details/68493297https://blog.youkuaiyun.com/lanvent/article/details/68493297lanventThu, 30 Mar 2017 19:48:19 +0800=0(1=0另外有一些像p[i]−p[j]≤k(i>j)p[i]-p[j]\le k\quad(i>j) 和p[i]−p[j]>k(i>j)p[i]-p[j]\gt k\quad(i>j) 的约束,求p[n]-p[1]的最大值，可以任意大输出-2，无解输出-1 差分约束转化到最短路模型，]]>https://blog.youkuaiyun.com/lanvent/article/details/68491803https://blog.youkuaiyun.com/lanvent/article/details/68491803lanventThu, 30 Mar 2017 19:26:16 +0800= 0。要求在满足这些条件的情况下，求出p[n] - p[1]的最大值。 观察最短路的性质， dist[i]<=dist[j]+wt[j,i]dist[i]<=dist[j]+wt[j,i] 与p[j]<=p[i]+kp[j]<=p[i]+k 形式很相似 dist[i]=min{dist[j]]>https://blog.youkuaiyun.com/lanvent/article/details/68491430https://blog.youkuaiyun.com/lanvent/article/details/68491430lanventThu, 30 Mar 2017 18:56:29 +0800 #include #include #include #include https://blog.youkuaiyun.com/lanvent/article/details/68491376https://blog.youkuaiyun.com/lanvent/article/details/68491376lanventThu, 30 Mar 2017 18:48:21 +0800 #include #include #include #include https://blog.youkuaiyun.com/lanvent/article/details/68491352https://blog.youkuaiyun.com/lanvent/article/details/68491352lanventThu, 30 Mar 2017 18:44:45 +0800https://blog.youkuaiyun.com/lanvent/article/details/68485155https://blog.youkuaiyun.com/lanvent/article/details/68485155lanventThu, 30 Mar 2017 11:41:27 +0800 #include https://blog.youkuaiyun.com/lanvent/article/details/68485052https://blog.youkuaiyun.com/lanvent/article/details/68485052lanventThu, 30 Mar 2017 11:34:02 +0800 #include #include #include #include using name]]>https://blog.youkuaiyun.com/lanvent/article/details/68484915https://blog.youkuaiyun.com/lanvent/article/details/68484915lanventThu, 30 Mar 2017 11:25:14 +0800b的最短路+b->a的最短路之和 建反向边，正向反向各dijkstra一次//求源点a和到所有点b的a->b的最短路+b->a的最短路之和 正向反向各dj一次 数组开小TLE1,没开longlong WA1 加读入挂快1000ms #include #include #include #i]]>https://blog.youkuaiyun.com/lanvent/article/details/68484863https://blog.youkuaiyun.com/lanvent/article/details/68484863lanventThu, 30 Mar 2017 11:21:55 +0800 #include #include #include #include #include using namespace std; typedef pai]]>https://blog.youkuaiyun.com/lanvent/article/details/68484348https://blog.youkuaiyun.com/lanvent/article/details/68484348lanventThu, 30 Mar 2017 10:52:03 +0800https://blog.youkuaiyun.com/lanvent/article/details/68484169https://blog.youkuaiyun.com/lanvent/article/details/68484169lanventThu, 30 Mar 2017 10:41:49 +0800