제출 #841355

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

segments

#include <bits/stdc++.h>
using namespace std;

const int N = 5050 , inf = 1e9 + 199;

int32_t main()
{
    /// freopen("subsequence.in","r",stdin);
    /// freopen("subsequence.out","w",stdout);

    int n;
    cin>>n;
    vector<int>a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int say = 1,preind = 0 , presum = a[0] , cursum = 0;
    for(int i=1;i<n;i++){
        cursum += a[i];
        if(cursum < presum){
            continue;
        }
        while(preind + 1 < i){
            if(presum + a[preind + 1] > cursum - a[preind + 1]){
                break;
            }
            presum += a[preind + 1];
            cursum -= a[preind + 1];
            preind ++;
        }
        say++;
        presum = cursum;
        preind = i;
        cursum = 0;
    }
    if(cursum >= presum){
        say++;
    }
    cout << say << endl;

}
/*



*/

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