Skip to content
Snippets Groups Projects
Commit c2250cd9 authored by Bruno Freitas Tissei's avatar Bruno Freitas Tissei
Browse files

Add kadane

parent d1279cbe
Branches
No related tags found
No related merge requests found
/**
* Kadane
*
* Complexity (Time): O(n + m)
* Complexity (Space): O(n + m)
*/
int v[MAX];
int kadane() {
// Maximum so far (msf), Maximum ending here (meh).
int msf = -0x3f3f3f3f, meh = 0;
int start = 0, end = 0, s = 0;
for (int i = 0; i < n; ++i) {
meh += v[i];
if (msf < meh) {
msf = meh;
start = s;
end = i;
}
if (meh < 0) {
meh = 0;
s = i + 1;
}
}
return msf;
}
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment