Submission #765607

#	Time	Username	Problem	Language	Result	Execution time	Memory
765607		LucaIlie	Homecoming (BOI18_homecoming)	C++17	0 / 100	109 ms	8388 KiB

homecoming

#include <bits/stdc++.h>
#include "homecoming.h"

using namespace std;

const long long INF = 1e16;
const int MAX_N = 5000;
long long dp[MAX_N + 1][MAX_N + 1];

long long solve( int n, int k, int a[], int b[] ) {
    long long ans = 0;

    for ( int l = 0; l <= k; l++ ) {
        dp[n][n] = 0;
        for ( int i = n - 1; i >= 0; i-- ) {
            dp[i][i] = -INF;
            if ( i >= l ) {
                for ( int j = i + 1; j <= n + l; j++ )
                    dp[i][i] = max( dp[i][i], dp[i + 1][j] );
            }

            for ( int j = i + 1; j <= n + l; j++ )
                dp[i][j] = dp[i + 1][j] - b[i] + (j - i >= k ? a[i] : 0);
        }

        for ( int j = 0; j <= n + l; j++ )
            ans = max( ans, dp[0][j] );
    }

    return ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 18
• Subtask 3: 0 / 31
• Subtask 4: 0 / 38