제출 #1279599

#제출 시각아이디문제언어결과실행 시간메모리
1279599aryanSolar Storm (NOI20_solarstorm)C++20
8 / 100
165 ms33588 KiB
#include<bits/stdc++.h> using namespace std; using i64 = long long; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,s; i64 k; cin >> n >> s >> k; vector<i64> d(n); for(int i = 1;i < n;i++){ cin >> d[i]; d[i] += d[i - 1]; } vector<int> v(n); vector<i64> pref(n); for(int i = 0;i < n;i++){ cin >> v[i]; pref[i] = v[i]; if(i) pref[i] += pref[i - 1]; } vector<int> best(n); // what is the best node top put sheild if we want to take node i vector<int> nx(n); // next empty node if we take index i for(int i = 0;i < n;i++){ int ind = upper_bound(d.begin(),d.end(),d[i] + k) - d.begin(); nx[i] = ind; ind --; best[i] = ind; } auto S = [&](int l,int r){ if(l > r) return 0LL; return pref[r] - (l ? pref[l - 1] : 0); }; i64 ans = 0; int mi = 0; for(int i = 0;i < n;i++){ i64 my = S(i,min(n - 1,i + s - 1)); if(my > ans){ mi = i; ans = my; } } vector<int> fn; for(int i = mi;i <= min(mi + s - 1,n - 1);i++){ fn.push_back(i); } cout << (int) fn.size() << '\n'; for(int &e : fn) cout << e + 1 << " "; cout << '\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...