Submission #1266095

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266095		rayan_bd	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	328 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 5e5 + 100;
int a[mxN], pref[mxN];
int query(int l, int r){
    return pref[r] - pref[l - 1];
}
int get_ans(int point, int prev, int n){
    int ans = 1, idx = point + 1;
    while(idx <= n){
        int st = idx, en  = n, best = -1;
        while(st <= en){
            int mid = st + (en - st) / 2;
            if(query(idx, mid) >= prev){
                best = mid;
                en = mid - 1;
            }else{
                st = mid + 1;
            }
        }
        if(best == -1) break;
        else ++ans;
        prev = query(idx, best);
        idx = best + 1;
    }
    return ans;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

    int n, ans = 0;
    cin >> n;
    pref[0] = 0;

    for(int i = 1; i <= n; ++i){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }

    for(int i = 1, s = 0; i <= n; ++i){
        s += a[i];
        ans = max(ans, get_ans(i, s, n));
    }

    cout << ans << "\n";
    return 0;
}

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