제출 #1228949

#제출 시각아이디문제언어결과실행 시간메모리
1228949trimkusFeast (NOI19_feast)C++20
30 / 100
82 ms2632 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int N, K; cin >> N >> K; vector<ll> a(N); ll tot = 0; for (int i = 0; i < N; ++i) { cin >> a[i]; if (a[i] >= 0) tot += a[i]; } if (K > 1) { cout << tot << "\n"; return 0; } ll res = 0, sum = 0; for (int i = 0; i < N; ++i) { sum = max(sum + a[i], a[i]); res = max(res, sum); } cout << res << "\n"; }
#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...