제출 #1292198

#제출 시각아이디문제언어결과실행 시간메모리
1292198chaitanyamehtaSolar Storm (NOI20_solarstorm)C++20
0 / 100
276 ms20536 KiB
// #include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int ,int> #define v vector signed main(){ int n , s , k; cin>>n>>s>>k; vector<int> d(n); for(int i = 1 ; i <= n-1; i++){ cin>>d[i]; } v<int> v(n +1, 0) , impact(n + 1 , 0); for(int i = 1 ;i <= n ; i++)cin>>v[i]; for(int i = 1 ; i <= n; i++){ int dis = 0; int sum = 0; for(int j = i -1; ; j--){ dis += d[j]; if(dis > k) break; sum += v[j]; } dis = 0; for(int j = i +1; ; j++){ dis += d[j - 1]; if(dis > k) break; sum += v[j]; } impact[i] = sum + v[i]; // cout << impact[i] << "\n"; } cout << 1 << "\n"; int ans = max_element(impact.begin() , impact.end()) - impact.begin(); cout << ans; }
#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...