제출 #501619

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

segments

#include <iostream>

using namespace std;

#define MAX_N 100000

struct DP {
    int segm;
    long long suma;
};

int v[MAX_N + 1];
long long sp[MAX_N + 1];
DP dp[MAX_N + 1];

int main() {
    int n, i, j;

    cin >> n;
    for ( i = 1; i <= n; i++ ) {
        cin >> v[i];
        sp[i] = sp[i - 1] + v[i];
    }

    for ( i = 1; i <= n; i++ ) {
        dp[i] = { 1, sp[i] };
        for ( j = 1; j < i; j++ ) {
            if ( sp[i] - sp[j] >= dp[j].suma ) {
                if ( dp[j].segm + 1 > dp[i].segm )
                    dp[i] = { dp[j].segm + 1, sp[i] - sp[j] };
                else if ( dp[j].segm + 1 == dp[i].segm ) {
                    if ( sp[i] - sp[j] < dp[i].suma )
                        dp[i].suma = sp[i] - sp[j];
                }
            }
        }
    }

    cout << dp[n].segm;

    return 0;
}

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