ACWing795前缀和

ACWing795是关于前缀和的问题。前缀和是一种能够在O(n)的预处理，O(1)的查询每段区间的和的一个算法。在原数组a, a, a, a, a[5], …, a[n]中，前缀和Si表示数组的前i项和，即Si = a + a + a + … + a[i]。
ACWing795的前缀和可以通过计算数组的前缀和数组来实现。前缀和数组S[i]表示原数组a的前i项和。可以使用一个循环来计算前缀和数组，从2开始遍历，每次将当前项的值加上前一项的前缀和值即可。最后，通过查询前缀和数组来获取ACWing795的前缀和结果。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [acwing和leetcode-Algorithm:acwinglabuladongleetcode](https://download.csdn.net/download/weixin_38635794/20051122)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [Acwing---795.前缀和](https://blog.csdn.net/qq_51251599/article/details/128570728)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]