| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292204 | chaitanyamehta | Solar Storm (NOI20_solarstorm) | C++20 | 287 ms | 27256 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) , p(n + 1 , 0);
for(int i = 1 ;i <= n ; i++)cin>>v[i];
for(int i = 1; i<=n;i++){
p[i] = p[i-1]+v[i];
}
for(int i = 1 ;i<=n;i++){
int sum = 0;
int left = max(1LL , i - k - 1);
int right = min(n , i + k);
sum += p[i] - p[left];
sum += p[right] - p[i - 1];
impact[i] = sum;
}
cout << 1 << "\n";
int ans = max_element(impact.begin() , impact.end()) - impact.begin();
cout << ans;
}| # | 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... | ||||
