제출 #641114

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

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
const int mod=1e9+7, maxn=5e5+5;
ll n, a[maxn], ans, sum;
pair<ll, ll> last;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i];
    last={a[1], 1};
    ans=1;
    for(int i=2; i<=n; i++) {
        sum+=a[i];
        if(sum>=last.fi) {
            while(true) {
                if(last.fi+a[last.se+1]<=sum-a[last.se+1]) {
                    last.fi+=a[last.se+1];
                    sum-=a[last.se+1];
                    last.se++;
                } else break;
            }
            ans++;
            last={sum, i};
            sum=0;
        }
    }
    cout << ans << '\n';
}

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