제출 #985506

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985506		muratcepeda	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	504 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;
#define lli long long int
#define rep(i, a, b) for(int i = a; i <= b; i++)


#define MAX 100
#define MAXM 

lli n, a, b, y[MAX + 3], dp[MAX + 3][MAX + 3];

int main(){

    cin >> n >> a >> b;

    rep(i, 1, n){
        cin >> y[i];
        if(i > 1) dp[1][i] = y[i] + dp[1][i - 1];
        else dp[1][i] = y[i];
    }
    rep(fil, 2, b){
        rep(col, 1, n) dp[fil][col] = (1ll << 62);
    }
    rep(fil, 2, b){
        rep(col, fil, n){
            lli suma = y[col];
            for(int i = col - 1; i >= fil - 1; --i){
                dp[fil][col] = min(dp[fil][col], suma | dp[fil - 1][i]);
                suma += y[i];
            }
        }
    }
    lli res = (1ll << 62);
    rep(i, a, b){
        res = min(res, dp[i][n]);
    }
    cout << res;

    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29