-
Notifications
You must be signed in to change notification settings - Fork 0
/
17.equillibriumIndex.cpp
52 lines (49 loc) · 1.17 KB
/
17.equillibriumIndex.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
#include<unordered_set>
using namespace std;
typedef vector <int> vi;
typedef pair< int ,int > pii;
#define endl "\n"
#define sd(val) scanf("%d",&val)
#define ss(val) scanf("%s",&val)
#define sl(val) scanf("%lld",&val)
#define debug(val) printf("check%d\n",val)
#define all(v) v.begin(),v.end()
#define PB push_back
#define MP make_pair
#define FF first
#define SS second
#define ll long long
#define MOD 1000000007
#define clr(val) memset(val,0,sizeof(val))
#define what_is(x) cerr << #x << " is " << x << endl;
#define OJ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int equillibriumIndex(vector<int>& arr) {
int rightSum = 0;
for(int i = 0; i < arr.size(); i++) {
rightSum += arr[i];
}
int leftSum = 0;
for(int i = 0; i < arr.size(); i++) {
rightSum -= arr[i];
if(leftSum == rightSum)
return i;
leftSum += arr[i];
}
return -1;
}
int main() {
FIO
OJ
int size;
cin >> size;
vector<int> arr(size);
for(auto &it : arr) {
cin >> it;
}
cout << equillibriumIndex(arr);
return 0;
}