제출 #268529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
268529		Osama_Alkhodairy	Bigger segments (IZhO19_segments)	C++17	37 / 100	1578 ms	1784 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 500001;

int n;
vector <int> a;
pair <int, ll> dp[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    a.resize(n + 1);
    for(int i = 1 ; i <= n ; i++){
        cin >> a[i];
    }
    for(int i = 1 ; i <= n ; i++){
        ll sum = 0;
        for(int j = i ; j >= 1 ; j--){
            sum += a[j];
            if(sum >= dp[j - 1].second){
                dp[i] = make_pair(dp[j - 1].first + 1, sum);
                break;
            }
        }
    }
    cout << dp[n].first << endl;
}

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