제출 #1091346

#제출 시각아이디문제언어결과실행 시간메모리
1091346Trisanu_DasSolar Storm (NOI20_solarstorm)C++17
28 / 100
185 ms41044 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, s, k; cin >> n >> s >> k; int d[n], v[n + 1], x[n + 1], sum[n + 1]; for(int i = 1; i <= n - 1; ++i) cin >> d[i]; for(int i = 1; i <= n; ++i) cin >> v[i]; x[1] = 0; for(int i = 2; i <= n; ++i) x[i] = x[i - 1] + d[i - 1]; sum[0] = 0; for(int i = 1; i <= n; ++i) sum[i] = v[i] + sum[i - 1]; int ans_s = 0, ans_i = 0; for(int i = 1; i <= n; ++i) { int r = upper_bound(x + 1, x + n + 1, x[i] + k) - x - 1, l = lower_bound(x + 1, x + n + 1, x[i] - k) - x - 1; if(sum[r] - sum[l] > ans_s) { ans_s = sum[r] - sum[l]; ans_i = i; } } cout << 1 << '\n' << ans_i << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...