제출 #1320127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1320127		kenkunkin	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	332 KiB

segments

#include <bits/stdc++.h>

using namespace std;

void Init() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

typedef long long ll;
const int maxn = 5e5 + 5;
ll a[maxn];
int n;

void Input() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
}

int solve() {
    ll cur_sum = 0;
    ll last_sum = 0;
    int segments = 0;
    
    for (int i = n - 1; i >= 0; i--) {
        cur_sum += a[i];
        if (cur_sum >= last_sum || i == 0) {
            last_sum = cur_sum;
            cur_sum = 0;
            segments++;
        }
    }
    return segments;
}

void Bai() {
    cout << solve() << "\n";
}

int main() {
    Init();
    Input();
    Bai();
    return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27