제출 #1322531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1322531		michael12	Feast (NOI19_feast)	C++20	0 / 100	177 ms	327680 KiB

feast

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1);
    int cur = 0;
    int ans1 = 0;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] < 0){
            cur += 1;
        }
        ans1 += a[i];
    }
    
    if(cur == 0){
        cout << ans1 << endl;
    }
    else if(k == 1){
         int T = a[1], C = a[1];
         int S = 0;
         int sum = max(0, a[1]);
         for(int i = 2; i <= n; i++){
            sum += a[i];
            if(sum >= C){
                C = sum;
            }
            else if(sum < 0){
                sum = 0;
            }
         }
         
         cout << C;
    }
    else{
    vector<vector<long long>> mx(n + 1, vector<long long>(n + 1));
    for (int i = 1; i <= n; i++) {
        long long sum = 0, x = 0;
        for (int j = i; j <= n; j++) {
            sum += a[j];
            x = max(x, sum);
            if (sum < 0) {
                sum = 0;
            }
            mx[i][j] = x;
        }
    }
    
        vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, 0));
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= k; j++) {
                for (int r = 0; r < i; r++) {
                    dp[i][j] = max(dp[i][j], dp[r][j - 1] + mx[r + 1][i]);
                }
            }
        }
        cout << dp[n][k] << endl;
        return 0;
    }
    
}

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