Advertisement
TimxAG

Untitled

May 3rd, 2017
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5. int n,a[100],sum[100],sum_m=0,i_m,i,k,minn=INT_MAX;
  6. cin >> n;fill(sum,sum+n,0);
  7. for (i=0;i<n;i++)
  8. {
  9. cin >> a[i]; if (i==0) sum[i]=a[i]; else sum[i]=sum[i-1]+a[i];
  10. }
  11. sum_m=sum[n-1];
  12. cout << "Sum = " << sum_m << endl;
  13. for (i=0;i<n;i++)
  14. {
  15. k=sum_m-sum[i];
  16. if (abs(k-sum[i]+a[i])<minn) minn=abs(k-sum[i]+a[i]);
  17. }
  18. cout << "Positions:" << endl;int count=1;
  19. for (i=0;i<n;i++)
  20. {
  21. k=sum_m-sum[i];
  22. if (abs(k-sum[i]+a[i])==minn) { cout << count++ << ") " <<i+1 << endl; }
  23. }
  24. return 0;
  25. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement