Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

update some format problem #10

Merged
merged 1 commit into from
Sep 10, 2024
Merged

update some format problem #10

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions 5-图论.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -862,11 +862,11 @@ ll hungarian(ll n,ll m){
return ans;
}
```
=======
## 差分约束
给出一组包含m个不等式，n个未知数的不等式组
​ 形如：$x_i$ - $x_j$ <= $y_k$
​形如：$x_i$-$x_j$<=$y_k$
求满足这个不等式组的非负解，并且每个变量尽量小
Expand Down Expand Up @@ -923,7 +923,7 @@ for(int i=1;i<=n;i++){

通过这样求出来的是满足条件的**最大值**

为了**求最小值**，可以转化不等式为 $x_j$ >= $x_i$ - w;
为了**求最小值**，可以转化不等式为 $x_j$ >= $x_i$ - $w$;

存储部分不变

Expand Down
3 changes: 2 additions & 1 deletion 7-pb_ds.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
# `pb_ds`
# 7-pb_ds
---

## 解锁

Expand Down
5 changes: 3 additions & 2 deletions 8-网络流.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,6 @@
# 8-网络流
---

## 最大流
### dinic

Expand Down Expand Up @@ -89,8 +92,6 @@ void solve()
}
```

###

### 建模思想

#### 拆点
Expand Down
Loading