Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Minimalna razlika zbira članova niza sa desne i lijeve strane od i-te pozicije :)
- #include <iostream>
- using namespace std;
- int saberi (int a, int b, int c[50])
- {
- int s1 = 0, s2 = 0;
- for (int i=0; i<a; i++)
- s1 = s1 + c[i];
- for (int i=a+1; i<b; i++)
- s2 = s2 + c[i];
- if (s2 > s1)
- return s2 - s1;
- else return s1 - s2;
- }
- main()
- {
- int n, a[50], min = 100, poz, i;
- cin >> n;
- for (int i=0; i<n; i++)
- cin >> a[i];
- for (int i=1; i<n-1; i++)
- if (min > saberi (i, n, a))
- {
- min = saberi (i, n, a);
- poz = i+1;
- }
- // cout << saberi(i, n, a) << endl;
- cout << poz << endl;
- system ("PAUSE");
- }
Advertisement
Add Comment
Please, Sign In to add comment