This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, s, k; cin >> n >> s >> k;
int d[n - 1], v[n];
for(int i = 0; i < n - 1; i++) cin >> d[i];
for(int i = 0; i < n; i++) cin >> v[i];
int x[n + 1], pref[n + 1]; x[1] = 0; pref[0] = 0;
for(int i = 2; i <= n; i++) x[i] = x[i - 1] + d[i - 1];
for(int i = 1; i <= n; i++) pref[i] = pref[i - 1] + v[i];
int ans_s = 0, ans_i = 0;
for(int i = 1; i <= n; i++){
int l = lower_bound(x + 1, x + n + 1, x[i] - k) - x - 1,
r = upper_bound(x + 1, x + n + 1, x[i] + k) - x - 1;
if(pref[r] - pref[l] > ans_s){
ans_s = pref[r] - pref[l];
ans_i = i;
}
}
cout << 1 << '\n' << ans_i << '\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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |