Commit 22db935

committed

fix/issue182

1 parent d19f42c commit 22db935Copy full SHA for 22db935

File tree

-5

lines changed

-5

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`# Fenwick Tree`
`2`	`2`
`3`		`-Given an array of length $N,ドル it processes the following queries in $O(\log N)$ time.`
	`3`	`+Given an array of length $n,ドル it processes the following queries in $O(\log n)$ time.`
`4`	`4`
`5`	`5`	`- Updating an element`
`6`	`6`	`- Calculating the sum of the elements of an interval`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,7 @@ Let $g$ be a function such that $g(x)$ is the cost of the minimum cost $s-t$ flo`
`66`	`66`	`It returns $g$ as the list of the changepoints, that satisfies the followings.`
`67`	`67`
`68`	`68`	`- The first element of the list is $(0, 0)$.`
`69`		-- Both of `.first` and `.second` are strictly increasing.
	`69`	+- `.first` is strictly increasing and `.second` is non-descreasing.
`70`	`70`	`- No three changepoints are on the same line.`
`71`	`71`	`- (1) The last element of the list is $(x, g(x)),ドル where $x$ is the maximum amount of the $s-t$ flow.`
`72`	`72`	`- (2) The last element of the list is $(y, g(y)),ドル where $y = \min(x, \mathrm{flow\\_limit})$.`

Lines changed: 2 additions & 2 deletions

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,7 @@ vector<pair<Cap, Cost>> graph.slope(int s, int t, Cap flow_limit);`
`66`	`66`	`返り値に流量とコストの関係の折れ線が入る。全ての $x$ について、流量 $x$ の時の最小コストを $g(x)$ とすると、$(x, g(x))$ は返り値を折れ線として見たものに含まれる。`
`67`	`67`
`68`	`68`	`- 返り値の最初の要素は $(0, 0)$`
`69`		-- 返り値の`.first`、`.second`は共に狭義単調増加
	`69`	+- 返り値の`.first` は狭義単調増加、`.second`は広義単調増加
`70`	`70`	`- 3点が同一線上にあることはない`
`71`	`71`	`- (1) 返り値の最後の要素は最大流量 $x$ として $(x, g(x))$`
`72`	`72`	`- (2) 返り値の最後の要素は $y = \min(x, \mathrm{flow\\_limit})$ として $(y, g(y))$`

Comments

(0)