//g++ -o sol sol.cpp //cd C:\Users\Asus-1\OneDrive\Desktop #include <bits/stdc++.h> using namespace std; #define int long long #define ld long double const int INF = 1e18; const int N = 100001; #define S(a) a.begin() , a.end() #define pb push_back #define READ(l , r , a) for(int i = l;i <= r;i++) cin >> a[i] #define printV(l , r , a) for(int i = l;i <= r;i++) cout << a[i] << ' '; #define pii pair < int , int > int n; int a[500001] , p[500001]; signed main(){ ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); cin >> n; READ(1 , n , a); p[1] = a[1]; for(int i = 2;i <= n;i++) p[i] = p[i - 1] + a[i]; int ans = -1; for(int i = 1;i <= n;i++){ int cur_s = p[i] , res = 1 , s = 0; for(int j = i + 1;j <= n;j++){ s += a[j]; if(s >= cur_s){ ++res; cur_s = s; s = 0; } } ans = max(ans , res); } cout << ans << endl; }