-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathd.cpp
53 lines (48 loc) · 1.43 KB
/
d.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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t; cin >> t;
while(t--){
int n; cin >> n;
int arr[n];
for(int i = 0; i < n; i++){
cin >> arr[i];
}
int m = 0, a = 0, b = 0;
int apt = 0, bpt = n-1;
int preva = 0, prevb = 0;
while(apt <= bpt){
preva = 0;
while(apt <= bpt && preva <= prevb){
preva += arr[apt];
apt++;
}
m++;
a += preva;
prevb = 0;
if(apt <= bpt){
m++;
}
while(apt <= bpt && prevb <= preva){
prevb += arr[bpt];
bpt--;
}
b += prevb;
}
cout << m << " " << a << " " << b << endl;
}
return 0;
}