제출 #330687

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

segments

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
int32_t main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> pr(n + 1);
    for (int i = 0; i < n; ++i) {
        pr[i + 1] = pr[i] + a[i];
    }
    int x = a[0];
    int it = 1;
    int ans = 1;
    while (true) {
       // cout << x << endl;
        if (it >= n - 1) break;
        vector<int>::iterator it1 = pr.begin() + it + 1;
        int pos = lower_bound(it1, pr.end(), x + pr[it]) - pr.begin();
        {
            ans++;
            if (x < pr[pos] - pr[it]) {
                ans++;
                x = pr[pos] - pr[it];
                break;
            }
            it = pos;
        }
        
        //cout << it << endl;
    }
    cout << ans;
}

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