diff --git a/problems/周总结/20201126贪心周末总结.md b/problems/周总结/20201126贪心周末总结.md
index cdfe4a96..3494a320 100644
--- a/problems/周总结/20201126贪心周末总结.md
+++ b/problems/周总结/20201126贪心周末总结.md
@@ -69,7 +69,7 @@
 代码很简单，但是思路却比较难。还需要反复琢磨。
 
 针对[贪心算法：最大子序和](https://programmercarl.com/0053.最大子序和.html)文章中给出的贪心代码如下；
-```
+```cpp
 class Solution {
 public:
     int maxSubArray(vector<int>& nums) {