제출 #1265750

#제출 시각아이디문제언어결과실행 시간메모리
1265750kawhietBigger segments (IZhO19_segments)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int sum = 0, res = 1, prev = a[0], j = 1;
    for (int i = 1; i < n; i++) {
        sum += a[i];
        if (sum >= prev) {
            res++;
            while (prev + a[j] <= sum - a[j]) {
                prev += a[j];
                sum -= a[j];
                j++;
            }
            prev = sum;
            sum = 0;
        }
    }
    cout << res << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...