제출 #1292210

#제출 시각아이디문제언어결과실행 시간메모리
1292210chaitanyamehtaSolar Storm (NOI20_solarstorm)C++20
0 / 100
289 ms27256 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]; } int i = 1 , j = 1 , dis = 0 , sum = v[1]; while (j < i){ i++; dis += d[i - 1]; if(dis > k){ sum -= v[j]; j++; } sum += d[i]; impact[i] = sum; } 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...