#include <iostream>
#include <deque>
using namespace std;
int main() {
int n;
int cnt = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum = 0;
int flag = 1;
for (int j = i; j < n; j++) {
sum += a[j];
if (sum < 0) {
flag = 0;
break;
}
}
if (!flag) {
continue;
}
for (int j = 0; j < i; j++) {
sum += a[j];
if (sum < 0) {
break;
}
if (j == i - 1) {
cnt++;
}
}
}
cout << cnt;
return 0;
}
| AC | WA | TLE | MLE | RE | |
|---|---|---|---|---|---|
| 数量 | 16 | 2 | 2 | ||
| 占比 | 80% | 10% | 10% | ||
| 符合要求的测试点1 | 1 | 9 | 2 | ||
| ...的测试点2 | 3 | 12 | 4 | ||
| ...测试点3 | 5 | ||||
| ...点4 | 6 | ||||
| ...5 | 7 | ||||
| 6 | 8 | ||||
| 7 | 10 | ||||
| 8 | 11 | ||||
| 9 | 13 | ||||
| 10 | 14 | ||||
| 11 | 15 | ||||
| 12 | 16 | ||||
| 13 | 17 | ||||
| 14 | 18 | ||||
| 15 | 19 | ||||
| 16 | 20 |
请求O(1),O(slogn),O(logn),O(log2n),O(n),O(nlogn),O(nlog2n)代码