Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
max subsequence of array
#include <stdio.h> int main(void) { int arr[] = {-11,-2,3,-1,2,-9,-4,-5,-2, -3}; int cur = arr[0] >= 0? arr[0] : 0, max = arr[0]; int start = 0, end = 0; int i,j = cur == 0 ? 1 : 0; printf("Cur\tMax\tStart\tEnd\n"); printf("%d\t%d\t%d\t%d\n",cur,max,start,end); for (i = 1; i < 10; i++) { cur += arr[i]; if (cur > max) { max = cur; end = i; if (j > start) start = j; } if (cur < 0) { cur = 0; j = i+1; } printf("%d\t%d\t%d\t%d\n",cur,max,start,end); } }
run
|
edit
|
history
|
help
0
Print All Paths In Matrix
CutRod(BottomUp)
Weighted Average
Dijkastra
TREE - path from root to leaf with given sum
C5P20
articulation points and bridges
mirrorpoint
Grundy Number
const test