#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for(int i=l; i<=r; i++)
#define FOD(i, r, l) for(int i=r; i>=l; i--)
#define pii pair<int, int>
#define fi first
#define se second
const int MAXN=1e6+5;
const int oo=1e18+7;
const int mod=1e9+7;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("test.txt", "r", stdin);
// freopen("o2.out", "w", stdout);
if(fopen(".inp", "r")){
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for(int i=l; i<=r; i++)
#define FOD(i, r, l) for(int i=r; i>=l; i--)
#define pii pair<int, int>
#define fi first
#define se second
const int MAXN=1e6+5;
const int oo=1e18+7;
const int mod=1e9+7;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r){
return uniform_int_distribution<int>(l, r)(rng);
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("test.txt", "w", stdout);
int n=10;
cout << n << '\n';
int sum=0;
FOR(i, 1, n-1){
int x=rnd(-10, 10);
cout << x << ' ';
sum+=x;
}
cout << rnd(1-sum, 100);
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for(int i=l; i<=r; i++)
#define FOD(i, r, l) for(int i=r; i>=l; i--)
#define pii pair<int, int>
#define fi first
#define se second
const int MAXN=1e6+5;
const int oo=1e18+7;
const int mod=1e9+7;
int n;
int a[MAXN];
int f[1005][1005];
int dp(int i, int last){
if(i>n){
return 0;
}
if(f[i][last]!=-1){
return f[i][last];
}
int sum=0;
int ans=-oo;
FOR(j, i, n){
sum+=a[j];
if(sum>=last){
ans=max(ans, dp(j+1, sum)+1);
}
}
return f[i][last]=ans;
}
void solve(){
cin >> n;
FOR(i, 1, n){
cin >> a[i];
}
memset(f, -1, sizeof f);
cout << dp(1, 1);
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("test.txt", "r", stdin);
freopen("o1.out", "w", stdout);
if(fopen(".inp", "r")){
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
int T;
cin >> T;
while(T--){
solve();
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for(int i=l; i<=r; i++)
#define FOD(i, r, l) for(int i=r; i>=l; i--)
#define pii pair<int, int>
#define fi first
#define se second
const int MAXN=1e6+5;
const int oo=1e18+7;
const int mod=1e9+7;
int n;
int a[MAXN];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("test.txt", "r", stdin);
// freopen("o2.out", "w", stdout);
if(fopen(".inp", "r")){
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
cin >> n;
FOR(i, 1, n){
cin >> a[i];
}
int ans=0;
int last=1;
for(int i=1; i<=n; ){
int j=i;
int sum=0;
while(j<=n && sum<last){
sum+=a[j];
j++;
}
while(j<=n && a[j]<0 && sum+a[j]>=last){
sum+=a[j];
j++;
}
if(sum>=last){
ans++;
}
last=sum;
i=j;
}
cout << ans;
return 0;
}
