Submission #1270215

#TimeUsernameProblemLanguageResultExecution timeMemory
1270215nlsosadFeast (NOI19_feast)C++20
12 / 100
93 ms4936 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int a[300001]; int pf[300001]; signed main(){ int n, k; cin >> n >> k; int sum = 0; int cnt = 0; for (int i = 1;i<=n;++i){ cin >> a[i]; pf[i] = pf[i-1] + a[i]; sum += a[i]; if(a[i]<0)cnt++; } if(cnt==1){ for (int i = 1;i<=n;++i){ if(a[i]<0){ if(k==1){ cout << max({sum, pf[i-1], sum-pf[i]}); }else cout << sum-a[i]; } } }else cout << sum; }
#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...