This website requires JavaScript.
Explore
Help
Sign In
james
/
holiday
Watch
1
Star
0
Fork
0
You've already forked holiday
Code
Issues
Pull Requests
Projects
Releases
Wiki
Activity
holiday
/
8.15
History
ljcjames
97a8edfd18
8.15c
2022-08-16 09:56:31 +08:00
..
A-Intervals
8.15 10:35
2022-08-15 10:35:14 +08:00
B-House Man
8.15B题笔记
2022-08-15 21:38:09 +08:00
C-Schedule Problem
8.15c
2022-08-16 09:56:31 +08:00
F-Candies
8.15B题笔记
2022-08-15 21:38:09 +08:00
-1.png
差分约束的md
2022-08-15 21:52:38 +08:00
2022暑假训练题08:差分约束.url
8.15 10:35
2022-08-15 10:35:14 +08:00
Readme.md
差分约束的md
2022-08-15 21:52:38 +08:00
差分约束20220815.pptx
8.15 10:35
2022-08-15 10:35:14 +08:00
Readme.md
Unescape
Escape
差分约束
https://vjudge.net/contest/509525#discuss
题意
不明所以
做法
x1-x2<=w
x1<=x2+w
dist[v]<=dist[u]+w
add(x2,x1,w);
x1-x2>=1? add(x1,x2,-1);
最短路->最大值,反之亦然
关键词
数学
,
最短路
,
spfa
易错点
隐藏条件
构图
工具箱
PPT