제출 #332116

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

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 500'005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

ll sum[N];
int ans[N];
ll p[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;

    for(int i = 1; i <= n; ++i){
        cin>>p[i];
        p[i] += p[i - 1];
        sum[i] = 1;
    }
    int t = 0, nt = 1;
    for(int i = 1; i <= n; ++i){
        if(p[i] - p[nt] >= sum[nt])
            t = nt;
        while(p[i] - p[t + 1] >= sum[t + 1])
            ++t;
        sum[i] = p[i] - p[t];
        ans[i] = ans[t] + 1;
        
        if(ans[i] > ans[i - 1]) nt = i;
    }
    cout<<ans[n];
}

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