제출 #486850

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

segments

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

#define ll long long
#define f first
#define s second

int n; ll pre[500005]; pair<int, ll> bst, dp[500005]; 

int main(){
    int n; cin >> n; 
    for (int i = 1; i <= n; i++) cin >> pre[i], pre[i] += pre[i - 1];

    for (int i = 1, l = 0; i <= n; i++){
        while (l < i and pre[i] - pre[l] >= dp[l].s){
            bst = max(bst, {dp[l].f + 1, l});
            l++;
        }
        dp[i] = {bst.f, pre[i] - pre[bst.s]};    
    }
    cout<<dp[n].f<<endl;
}

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