用C++计算连续k个守卫的最大危险程度总和

```cpp #include <iostream> using namespace std; const int MAXN = 100005; int a[MAXN]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } // 计算前k个人的危险程度总和 int sum = 0; for (int i = 0; i < k; i++) { sum += a[i]; } int maxSum = sum; // 滑动窗口计算后续连续k个人的危险程度总和 for (int i = k; i < n; i++) { sum = sum - a[i - k] + a[i]; if (sum > maxSum) { maxSum = sum; } } cout << maxSum << endl; return 0; } ``` ######[AI问答 | 242点数解答 | 2026-04-08 21:12:35]