# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344533 | Nurlykhan | Bigger segments (IZhO19_segments) | C++17 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = (int)5e5 + 10;
const int mod = (int)1e9 + 7;
int n;
int a[N];
ll pref[N];
ll get_sum(int l, int r) {
return pref[r] - pref[l - 1];
}
int get(int it) {
ll sum = 0;
for (int i = 0; i <= it; i++) {
sum += a[it];
}
int cnt = 0;
it++;
while (it < n) {
ll cur_sum = 0;
while (it < n && cur_sum < sum) {
cur_sum += a[it];
it++;
}
if (cur_sum >= sum) {
cnt++;
}
sum = cur_sum;
}
return cnt + 1;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
pref[i] = pref[i - 1] + a[i];
}
int ans = 0;
ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, get(i));
}
printf("%d", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |