Submission #1315946

#TimeUsernameProblemLanguageResultExecution timeMemory
1315946samarthkulkarniFeast (NOI19_feast)C++20
22 / 100
24 ms2680 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}

const int N = 3e5+10;
ll a[N];


void solution() {
	ll n, k; cin >> n >> k;

	for (int i = 1; i <= n; i++) cin >> a[i];


	ll best = 0;
	ll sum = 0;

	for (int i = 1; i <= n; i++) {
		sum += a[i];
		if (sum < 0) sum = 0;
		best = max(best, sum);
	}

	cout << best << endl;



}
#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...