제출 #1309704

#제출 시각아이디문제언어결과실행 시간메모리
1309704aaaaaaaaFeast (NOI19_feast)C++20
4 / 100
23 ms1604 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]; } cout << (k > 1 ? s1 + ans : max({all, 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...