Submission #1309705

#TimeUsernameProblemLanguageResultExecution timeMemory
1309705aaaaaaaaFeast (NOI19_feast)C++20
12 / 100
23 ms1600 KiB
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, k; cin >> n >> k; vector<int> a(n + 1, 0); long long ans = 0, s1 = 0, all = 0; for(int i = 1; i <= n; ++i){ cin >> a[i]; if(a[i] >= 0) ans += (long long) a[i]; else { s1 = ans; ans = 0; } all += (long long) a[i]; } if(k == 1){ cout << max({ans, s1, all}) << "\n"; }else{ cout << ans + s1 << "\n"; } return 0; }
#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...