From b7779a0db9a10197bd8c81e540e424c854d33af0 Mon Sep 17 00:00:00 2001
From: Sshwy <jy.cat@qq.com>
Date: Tue, 16 Jul 2019 22:34:56 +0800
Subject: [PATCH] =?utf8?q?fix=EF=BC=9A=E4=BF=AE=E6=AD=A3=E4=BB=A3=E7=A0=81?=
 =?utf8?q?=E4=B8=AD=E7=9A=84=E5=8F=8C##=E9=97=AE=E9=A2=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=utf8
Content-Transfer-Encoding: 8bit

QAQ
---
 docs/ds/segment-tree-beats.md | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/docs/ds/segment-tree-beats.md b/docs/ds/segment-tree-beats.md
index a23c9303..9caaa375 100644
--- a/docs/ds/segment-tree-beats.md
+++ b/docs/ds/segment-tree-beats.md
@@ -23,7 +23,10 @@
 这个算法的复杂度如何？使用势能分析法可以得到复杂度是 $O(m\log_2n)$ 的。具体分析过程见论文。
 
 ```cpp
-##include<cstdio>##include<algorithm>##include<cctype> using namespace std;
+#include<cstdio>
+#include<algorithm>
+#include<cctype> 
+using namespace std;
 const int N = 1e6 + 6;
 
 char nc() {
@@ -145,7 +148,9 @@ signed main() {
 另外，BZOJ 这道题卡常……多数组线段树的常数比结构体线段树的常数大……在维护信息的时侯，当只有一两个数的时侯可能发生数集重合，比如一个数既是最大值又是次小值。这种要特判。
 
 ```cpp
-##include<cstdio>##include<iostream> using namespace std;
+#include<cstdio>
+#include<iostream> 
+using namespace std;
 
 int inline rd() {
   register char act = 0;
-- 
2.11.0