This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<ll> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
// K = 1
vector<ll> prefixSum(N);
ll minPrefix = 0;
ll res = 0;
for (int i = 0; i < N; i++)
{
if (i) prefixSum[i] = prefixSum[i-1];
prefixSum[i] += a[i];
minPrefix = min(minPrefix, prefixSum[i]);
res = max(res, prefixSum[i] - minPrefix);
}
cout << res << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |