#include<bits/stdc++.h>
#define ll long long
#define fi first
#define sec second
#define pb push_back
#define pqueue priority_queue
#define int long long
using namespace std;
ll t,n,m,ans=0,x;
string soy;
pair<int,int> a[100005];
int pref[100005];
main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>x;
a[i].fi=a[i-1].fi+x;
a[i].sec=i;
}
for(int i=1;i<=n;i++){
a[i].fi-=100*i;
}
sort(a,a+n+1);
pref[0]=a[0].sec;
for(int i=1;i<=n;i++){
pref[i]=min(pref[i-1],a[i].sec);
}
int j=0;
for(int i=1;i<=n;i++){
while(j<n&&a[j+1].fi<a[i].fi) j++;
if(a[i].fi>a[j].fi) ans=max(ans,a[i].sec-pref[j]);
}
cout<<ans<<endl;
}
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |