| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1138192 | Pwo | Fish 3 (JOI24_fish3) | C++20 | 56 ms | 6792 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, d, q, a[300005], pre[300005];
int32_t main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n >> d;
for (int i = 1 ; i <= n; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + max((int) 0, a[i - 1] - a[i]);
}
cin >> q;
while (q--) {
int l, r; cin >> l >> r;
cout << pre[r] - pre[l] << '\n';
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
