Guest User

Untitled

a guest
Oct 25th, 2023
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int main() {
  4. int arr[] = {-1, 2, 4, -3, 5, 2, -5, 2};
  5. int best = 0, sum = 0, len = 0;
  6. int *ptr = arr;
  7. int *current_ptr = arr;
  8. for (int k = 0; k < sizeof(arr)/sizeof(*arr); k++) {
  9. if (arr[k] > sum + arr[k]) {
  10. sum = arr[k];
  11. current_ptr = &arr[k];
  12. } else {
  13. sum += arr[k];
  14. }
  15. if (best < sum) {
  16. best = sum;
  17. ptr = current_ptr;
  18. }
  19. }
  20. printf("%d\n", best);
  21. return 0;
  22. }
Advertisement
Add Comment
Please, Sign In to add comment