Advertisement
Guest User

Untitled

a guest
Mar 17th, 2018
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.40 KB | None | 0 0
  1. void secvMaxima2(int n, int v[], int &pi2, int &pf2, int c)
  2. {
  3. int i, j;
  4. int max, lung,s;
  5. max = 0;
  6. i = 0;
  7. pi2 = -1;
  8. pf2 = -1;
  9. while (i < n)
  10. {
  11. lung = 0;
  12. j = i ;
  13. s = 0;
  14. while ((j<n) && (s!=c))
  15. {
  16. s = s + v[j];
  17. j++;
  18. lung++;
  19.  
  20. if (s==c)
  21. {
  22. if (lung > max)
  23. {
  24. max = lung;
  25. pi2 = i;
  26. pf2 = j-1;
  27.  
  28. }
  29. }
  30.  
  31. }
  32. i++;
  33. }
  34.  
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement