Submission #1232697

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232697		395333em	Feast (NOI19_feast)	C++20	59 / 100	1095 ms	11844 KiB

feast

#include <bits/stdc++.h>
#define int long long
#define emb emplace_back
#define pii pair <int, int>

using namespace std;

const int mod = 1e9 + 7;
const int inf = 1e18;
const int N = 3e5 + 5;

int n, k, ans, a[N], dp[2][N][2];

signed main(){
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= k; i++) {
        for (int j = i; j <= n; j++) {
            dp[i % 2][j][1] = max(dp[i % 2][j - 1][1] + a[j], dp[(i - 1) % 2][j - 1][0] + a[j]);
            dp[i % 2][j][0] = max(dp[i % 2][j][1], dp[i % 2][j - 1][0]);
            ans = max(ans, dp[i % 2][j][0]);
        }
    }
    cout << ans;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 0 / 29