| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 37512 | diandian | 子数组最大平均数 | C++ | Wrong Answer | 0 MS | 252 KB | 371 | 2024-01-21 11:38:32 |
#include <bits/stdc++.h> using namespace std; int a[260], b[260]; int main(){ int n, m; cin >> n >> m; for (int i = 1; i <= n; ++ i) cin >> a[i]; while (m--){ int l, r, c; b[l] += c; b[r + 1] -= c; } for (int i = 1; i <= n; ++ i){ a[i] = b[i] + a[i - 1]; cout << a[i]; } return 0; }