#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll
void solve() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> pref(n + 1);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + a[i - 1];
}
vector<pair<int, int>> dp(n + 1);
set<pair<int, int>> st;
st.insert({0, 0});
int mx = 0;
for (int i = 1; i <= n; i++) {
while (!st.empty() && (*st.begin()).first <= pref[i]) {
int ind = (*st.begin()).second;
mx = max(mx, ind);
st.erase(st.begin());
}
dp[i] = {pref[i] - pref[mx], dp[mx].second + 1};
st.insert({dp[i].first + pref[i], i});
}
cout << dp[n].second << '\n';
}
signed main() {
int tt = 1;
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
cin >> tt;
#else
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#endif
while (tt--) {
solve();
}
return 0;
}
