Advertisement
Guest User

Untitled

a guest
Apr 26th, 2017
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int main(){
  6. int niz[] = {3,0,-5,2,4,-1,2,-10,4};
  7. int niz2[9];
  8. int in[9];
  9. int maxx = -9999999;
  10. int maxxin = 0;
  11. niz2[0] = niz[0];
  12. in[0] = 0;
  13. maxx = niz[0];
  14.  
  15. for(int i = 1; i < 9; i++){
  16. if(niz2[i-1] + niz[i] > niz[i]){
  17. niz2[i] = niz2[i-1] + niz[i];
  18. in[i] = in[i-1];
  19. }else{
  20. niz2[i] = niz[i];
  21. in[i] = i;
  22. }
  23. if (niz2[i] > maxx) {
  24. maxx = niz2[i];
  25. maxxin = i;
  26.  
  27. }
  28. }
  29. cout << "Max je " << maxx << ". Indexi su l= " << in[maxxin] << " r= " << maxxin << endl;
  30.  
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement