제출 #603254

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

segments

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for (int i = (a); i <= (b);i++)
#define repa(i,a,b) for (int i = (a); i >= (b);i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 3000
#define val first
#define res second

lli n,sum;
lli arr[MAX+2];
pair<lli,lli> dp[MAX+2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    rep(i,1,n) cin >> arr[i];

    rep(i,1,n) {
        sum = arr[i];
        repa(j,i-1,0) {
            if (dp[j].val <= sum) {
                dp[i].val = sum;
                dp[i].res = dp[j].res + 1;
                break;
            }
            sum += arr[j];
        }
    }

    cout << dp[n].res;
}

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