제출 #535792

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

segments

#include <iostream>
#include <deque>
using namespace std;

int main() {
    int n; cin >> n;
    
    long long x = 0, ss = 0;
    long long ls = 0, ns = 0;
    deque<long long> deq;
    for(int i = 0; i < n; i++){
        cin >> x, ns += x, deq.push_front(x);
        if(ns >= ls){
            ++ss;
            while(ns-2*deq.back() >= ls){
                ns -= deq.back();
                ls += deq.back();
                deq.pop_back();
            }
            ls = ns, ns = 0;
            deq.erase(deq.begin(),deq.end());
        }
            
    }
    
    cout << ss;
}

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