Submission #443974

#	Time	Username	Problem	Language	Result	Execution time	Memory
443974		Idkwhoami	Candies (JOI18_candies)	C++17	8 / 100	229 ms	524292 KiB

candies

#include <bits/stdc++.h>

using namespace std; 

#define ll long long

int main() {
    ll n;
    cin >> n;
    vector<ll> v(n+1);
    vector<vector<ll>> dp(n+1, vector<ll>(n+1, 0));
    for(int i = 1;i<=n;i++)cin >> v[i];

    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=n;j++){
            if(i == 1 && j == 1)dp[i][j] = v[i];
            else if(j > (i+1)/2)dp[i][j] = -1;
            else{
                dp[i][j] = max(dp[i-2][j-1] + v[i], dp[i-1][j]);
            }
            // cout << dp[i][j] << " ";
        }
        // cout << '\n';
    }
    for(int j = 1;j<=(n+1)/2;j++)cout << dp[n][j] << "\n";

}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 92