Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main() {
- int arr[] = {-1, 2, 4, -3, 5, 2, -5, 2};
- int best = 0, sum = 0, len = 0;
- int *ptr = arr;
- int *current_ptr = arr;
- for (int k = 0; k < sizeof(arr)/sizeof(*arr); k++) {
- if (arr[k] > sum + arr[k]) {
- sum = arr[k];
- current_ptr = &arr[k];
- } else {
- sum += arr[k];
- }
- if (best < sum) {
- best = sum;
- ptr = current_ptr;
- }
- }
- printf("%d\n", best);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment