From d53015fb52262e4d7c471ddb21063f143cbd2876 Mon Sep 17 00:00:00 2001
From: ChungZH <42088872+ChungZH@users.noreply.github.com>
Date: Sat, 24 Nov 2018 13:08:01 +0800
Subject: [PATCH] Update prefix-sum.md
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit

添加习题
---
 docs/basic/prefix-sum.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/docs/basic/prefix-sum.md b/docs/basic/prefix-sum.md
index 73905505..0a4a811e 100644
--- 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)
+
 ### 参考
 
 感谢南海区青少年信息学奥林匹克内部训练教材。
-- 
2.11.0