花的美丽值区间求和问题的高效解法

```cpp #include <iostream> using namespace std; const int MAXN = 100010; int a[MAXN], sum[MAXN]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum[i] = sum[i - 1] + a[i]; } int m; cin >> m; for (int i = 0; i < m; i++) { int L, R; cin >> L >> R; cout << sum[R] - sum[L - 1] << endl; } return 0; } ``` ######[AI问答 | 187点数解答 | 2026-05-30 19:38:15]