제출 #565372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565372		Stickfish	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	312 KiB

segments

#include <iostream>
using namespace std;
using ll = long long;

const int MAXN = 5e5 + 123;
int a[MAXN];

signed main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    ll psm = 0;
    int previ = 0;
    ll sm = 0;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        sm += a[i];
        if (sm >= psm) {
            while (previ < i && sm - 2 * a[previ] >= psm) {
                sm -= a[previ];
                psm += a[previ];
                ++previ;
            }
            psm = sm;
            sm = 0;
            previ = i + 1;
            ++ans;
        }
    }
    cout << ans << endl;
}

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