OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
745afda
)
Update prefix-sum.md
author
ChungZH
<42088872+ChungZH@users.noreply.github.com>
Sat, 24 Nov 2018 05:08:01 +0000
(13:08 +0800)
committer
GitHub
<noreply@github.com>
Sat, 24 Nov 2018 05:08:01 +0000
(13:08 +0800)
添加习题
docs/basic/prefix-sum.md
patch
|
blob
|
history
diff --git
a/docs/basic/prefix-sum.md
b/docs/basic/prefix-sum.md
index
7390550
..
0a4a811
100644
(file)
--- a/
docs/basic/prefix-sum.md
+++ b/
docs/basic/prefix-sum.md
@@
-51,6
+51,12
@@
int main() {
`B[i] = B[i-1] + A[i]` 相信大家也能理解这个式子。意思就是:前缀和数组的第 i 项等于数组 A 的 0 到 i-1 项的和加数组 A 的第 i 项。
+
+### 习题
+
+1. [ U53525 前缀和(例题)
+](https://www.luogu.org/problemnew/show/U53525)
+
### 参考
感谢南海区青少年信息学奥林匹克内部训练教材。