제출 #526568

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

segments

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

const int N = 500005;

ll n,a[N];
ll ans;
ll cur,pre,pre_ehlel,pre_end;

int main(){
    IOS
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    cur=0;
    pre=a[1];
    pre_end=1;
    ans=1;
    int l=2;
    while(l<=n){
        cur+=a[l];
        if(cur>=pre){
            for(int i=pre_end+1; i<=l; i++){
                if(cur-a[i]>=pre+a[i]){
                    cur-=a[i];
                    pre+=a[i];
                }
                else break;
            }
            pre_end=l-1;
            pre=cur;
            ans++;
            cur=0;
            if(l==n){
                cout<<ans;
                return 0;
            }
        }
        l++;
    }
    cout<<ans-1;

}

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