ソースコード
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
long long int power(long long int x, long long int n, long long int M) {
long long int tmp = 1;
if (n > 0) {
tmp = power(x, n / 2, M);
if (n % 2 == 0) tmp = (tmp*tmp) % M;
else tmp = (((tmp*tmp) % M)*x) % M;
}
return tmp;
}
long long int N, M, K, Q, W, H, L, R;
long long int ans;
int main() {
ios::sync_with_stdio(false);
cin >> N;
long long int num[100001] = {};
for (int i = 1; i <= N; i++)cin >> num[i];
for (int i = 1; i <= N; i++)num[i] += num[i - 1];
L = 0;
R = N;
while (R - L > 1) {
int mid = (R + L) / 2;
bool flag = false;
for (int i = 1; (i + mid - 1) <= N; i++) {
if (num[i + mid - 1] - num[i - 1] >= 0) {
flag = true;
break;
}
}
if (flag)L = mid;
else R = mid;
}
for (int i = 1; (i + R - 1) <= N; i++) {
if (num[i + R - 1] - num[i - 1] >= 0) {
cout << R << endl;
return 0;
}
}
if (L) {
for (int i = 1; (i + L - 1) <= N; i++) {
if (num[i + L - 1] - num[i - 1] >= 0) {
cout << L << endl;
return 0;
}
}
}
L--;
if (L) {
for (int i = 1; (i + L - 1) <= N; i++) {
if (num[i + L - 1] - num[i - 1] >= 0) {
cout << L << endl;
return 0;
}
}
}
cout << "-1\n";
return 0;
}